Affiliation:
1. School of Mathematics Monash University Melbourne Victoria Australia
Abstract
AbstractDujmovć, Joret, Micek, Morin, Ueckerdt, and Wood established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically studies various structural properties of cartesian, direct and strong products. In particular, we characterise when these graph products contain a given complete multipartite subgraph, determine tight bounds for their degeneracy, establish new lower bounds for the treewidth of cartesian and strong products, and characterise when they have bounded treewidth and when they have bounded pathwidth.
Funder
Australian Research Council
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference80 articles.
1. The Hadwiger number for the product of two cycles;Archdeacon D.;Discrete Math. Theor. Comput. Sci,1997
2. A.Bickle Thek$k$‐cores of a graph Ph.D. thesis Western Michigan University USA 2010.
3. Quickly excluding a forest
4. A tourist guide through treewidth;Bodlaender H. L.;Acta Cybernet,1993
5. A partial k-arboretum of graphs with bounded treewidth