License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2018.33
URN: urn:nbn:de:0030-drops-87460
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8746/
Go to the corresponding LIPIcs Volume Portal


Dvorák, Zdenek ; Hlinený, Petr ; Mohar, Bojan

Structure and Generation of Crossing-Critical Graphs

pdf-format:
LIPIcs-SoCG-2018-33.pdf (0.6 MB)


Abstract

We study c-crossing-critical graphs, which are the minimal graphs that require at least c edge-crossings when drawn in the plane. For c=1 there are only two such graphs without degree-2 vertices, K_5 and K_{3,3}, but for any fixed c>1 there exist infinitely many c-crossing-critical graphs. It has been previously shown that c-crossing-critical graphs have bounded path-width and contain only a bounded number of internally disjoint paths between any two vertices. We expand on these results, providing a more detailed description of the structure of crossing-critical graphs. On the way towards this description, we prove a new structural characterisation of plane graphs of bounded path-width. Then we show that every c-crossing-critical graph can be obtained from a c-crossing-critical graph of bounded size by replicating bounded-size parts that already appear in narrow "bands" or "fans" in the graph. This also gives an algorithm to generate all the c-crossing-critical graphs of at most given order n in polynomial time per each generated graph.

BibTeX - Entry

@InProceedings{dvork_et_al:LIPIcs:2018:8746,
  author =	{Zdenek Dvor{\'a}k and Petr Hlinen{\'y} and Bojan Mohar},
  title =	{{Structure and Generation of Crossing-Critical Graphs}},
  booktitle =	{34th International Symposium on Computational Geometry (SoCG 2018)},
  pages =	{33:1--33:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-066-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{99},
  editor =	{Bettina Speckmann and Csaba D. T{\'o}th},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8746},
  URN =		{urn:nbn:de:0030-drops-87460},
  doi =		{10.4230/LIPIcs.SoCG.2018.33},
  annote =	{Keywords: crossing number, crossing-critical, path-width, exhaustive generation}
}

Keywords: crossing number, crossing-critical, path-width, exhaustive generation
Collection: 34th International Symposium on Computational Geometry (SoCG 2018)
Issue Date: 2018
Date of publication: 08.06.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI