gdea_3Planar Decompositions and the Crossing Number of Graphs with an Excluded MinorDavid R.WoodauthorJan ArneTelleauthorTree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar decomposition with bounded width and a linear number of bags. The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. We prove that planar decompositions are intimately related to the crossing number, in the sense that a graph with bounded degree has linear crossing number if and only if it has a planar decomposition with bounded width and linear order. It follows from the above result about planar decompositions that every graph with bounded degree and an excluded minor has linear crossing number. Analogous results are proved for the convex and rectilinear crossing numbers. In particular, every graph with bounded degree and bounded tree-width has linear convex crossing number, and every K_3,3-minor-free graph with bounded degree has linear rectilinear crossing number. G.420 CrossingsM.999 OthersZ.999 Others2007SpringerConference Paper

For work being deposited by its own author: In self-archiving this collection of files and associated bibliographic metadata, I grant gdea the right to store them and to make them permanently available publicly for free on-line. I declare that this material is my own intellectual property and I understand that gdea does not assume any responsibility if there is any breach of copyright in distributing these files or metadata. (All authors are urged to prominently assert their copyright on the title page of their work.)

For work being deposited by someone other than its author: I hereby declare that the collection of files and associated bibliographic metadata that I am archiving at gdea) is in the public domain. If this is not the case, I accept full responsibility for any breach of copyright that distributing these files or metadata may entail.

Clicking on the deposit button indicates your agreement to these terms.