Planar decompositions and the crossing number of graphs with an excluded minor

New York Journal of Mathematics

Volumn 13, Issue , 2007, Pages 117-146

  Wood, David R ^a   Telle, Jan Arne ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Convex crossing number; Crossing number; Graph decomposition; Graph drawing; Graph minor; Outerplanar crossing number; Planar decomposition; Planar partition; Rectilinear crossing number; Tree decomposition; Tree partition; Tree partition width; Tree width

Indexed keywords

EID: 34347350101     PISSN: None     EISSN: 10769803     Source Type: Journal    
DOI: None     Document Type: Article

References (96)

1. n. J. Combin. Theory Ser. B 90 (2004), no. 1, 21-39. MR2041316 (2005f:05040), Zbl 1033.05026.
2. AGNEW, MELANIE J. It's in the bag: Plane decompositions as tools for approximation. Master's thesis, Department of Computer Science, Rochester Institute of Technology, Rochester, New York, U.S.A., 2005.
3. AICHHOLZER, OSWIN; AURENHAMMER, FRANZ; KRASSER, HANNES. On the crossing number of complete graphs. Computing 76 (2006), no. 1, 165-176. MR2174677 (2006f:05047), Zbl 1082.05027.
4. AIGNER, MARTIN; ZIEGLER, GÜNTER M. Proofs from The Book. Springer, third edn., 2004. MR2014872 (2004h:00002), Zbl 1098.00001.
5. AJTAI, MIKLÓS; CHVÁTAL, VAŠEK; NEWBORN, MONROE M.; SZEMERÉDI, ENDRE. Crossingfree subgraphs. Theory and practice of combinatorics, 9-12, North-Holland Math. Stud., 60, North-Holland, Amsterdam, 1982. MR806962 (86k:05059), Zbl 0502.05021.
6. ALON, NOGA; DING, GUOLI; OPOROWSKI, BOGDAN; VERTIGAN, DIRK. Partitioning into graphs with only small components. J. Combin. Theory Ser. B 87 (2003), no. 2, 231-243. MR1957474 (2004c:05146), Zbl 1023.05045.
7. ALON, NOGA; SEYMOUR, PAUL D.; THOMAS, ROBIN. A separator theorem for nonplanar graphs. J. Amer. Math. Soc. 3 (1990), no. 4, 801-808. MR1065053 (91h:05076), Zbl 0747.05051.
8. BHATT, SANDEEP N.; LEIGHTON, F. THOMSON. A framework for solving VLSI graph layout problems. J. Comput. System Sci. 28 (1984), no. 2, 300-343. MR0760549 (86g:68139).
9. BIEDL, THERESE; DEMAINE, ERIK D.; DUNCAN, CHRISTIAN A.; FLEISCHER, RUDOLF; KOBOUROV, STEPHEN G. Tight bounds on maximal and maximum matchings. Discrete Math. 285 (2004), no. 1-3, 7-15. MR2074836 (2005b:05179), Zbl 1044.05056.
10. BIENSTOCK, DANIEL; DEAN, NATHANIEL. Bounds for rectilinear crossing numbers. J. Graph Theory 17 (1993), no. 3, 333-348. MR1220994 (94e:05134), Zbl 0777.05049.
11. BODLAENDER, HANS L. Planar graphs with bounded treewidth. Tech. Rep. RUU-CS-88-14, Department of Computer Science, University of Utrecht, Netherlands, 1988.
12. BODLAENDER, HANS L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 (1998), no. 1-2, 1-45. MR1647486 (99k:05146), Zbl 0912.68148.
13. BODLAENDER, HANS L. A note on domino treewidth. Discrete Math. Theor. Comput. Sci. 3 (1999), no. 4, 141-150. MR1691565 (2000b:05078), Zbl 0912.68148.
14. BODLAENDER, HANS L.; ENGELFRIET, JOOST. Domino treewidth. J. Algorithms 24 (1997), no. 1, 94-123. MR1453952 (98m:68200), Zbl 0882.68106.
15. BOKAL, DRAGO. On the crossing numbers of cartesian products with paths. J. Combin. Theory Ser. B 97 (2007), no. 3, 381-384
16. BOKAL, DRACO; CZABARKA, ÉVA; SZÉKELY, LÁSZLÓ A.; VRT́O, IMRICH. Graph minors and the crossing number of graphs. Electron. Notes Discrete Math. 28 (2007), 169-175.
17. BOKAL, DRACO; FIJAVŽ, GAŠPER; MOHAR, BOJAN. The minor crossing number. SIAM J. Discrete Math. 20 (2006), no. 2, 344-356. MR2257266.
18. BOKAL, DRAGO; FIJAVŽ, GAŠPER; WOOD, DAVID R. The minor crossing number of graphs with an excluded minor (2006). arXiv:math/0609707.
19. BÖRÖCZKY, KÁROLY; PACK, JÁNOS; TÓTH, GÉZA. Planar crossing numbers of graphs embeddable in another surface. Internat. J. Found. Comput. Sci. 17 (2006), no. 5, 1005-1015. MR2270948, Zbl 1100.68075.
20. BRODSKY, ALEX; DUROCHER, STEPHANE; GETHNER, ELLEN. Toward the rectilinear crossing number of Kn. new drawings, upper bounds, and asymptotics. Discrete Math. 262 (2003), no. 1-3, 59-77. MR1951377 (2003i:05039), Zbl 1013.05027.
21. CLARK, LANE H.; ENTRINGER, ROGER C. The bisection width of cubic graphs. Bull. Austral. Math. Soc. 39 (1989), no. 3, 389-396. MR0995136 (90m:05072), Zbl 0681.05040.
22. CZABARKA, ÉVA; SÝKORA, ONDREJ; SZÉKELY, LÁSZLÓ A.; VRT'O, IMRICH. Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions. Electron. J. Combin. 11 (2004), no. 1, R81. MR.2114185 (2006b:05040), Zbl 1080.05022.
23. DEMAINE, ERIC D.; HAJIAGHAYI, MOHAMMADTAGHI. Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. Proc. 16th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA '05), 682-689. ACM, 2005.
24. DEMAINE, ERIK D.; HAJIAGHAYI, MOHAMMADTAGHI; KAWARABAYASHI, KEN-ICHI. Algorithmic graph minor theory: Decomposition, approximation, and coloring. Proc. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS '05), 637-646. IEEE, 2005.
25. DEVOS, MATT; DING, GUOLI; OPOROWSKI, BOGDAN; SANDERS, DANIEL P.; REED, BRUCE; SEYMOUR, PAUL; VERTIGAN, DIRK. Excluding any graph as a minor allows a low tree-width 2-coloring. J. Combin. Theory Ser. B 91 (2004), no. 1, 25-11. MR2047529 (2004m:05247), Zbl 1042.05036.
26. DÍAZ, JOSEP; DO, NORMAN; SERNA, MARIA J.; WORMALD, NICHOLAS C. Bounds on the max and min bisection of random cubic and random 4-regular graphs. Theoret. Comput. Sci. 307 (2003), no. 3, 531-547. MR2021746 (2005h:05184), Zbl 1070.68119.
27. DIESTEL, REINHARD; KÜHN, DANIELA. Graph minor hierarchies. Discrete Appl. Math. 145 (2005), no. 2, 167-182. MR2113139 (20051:05180), Zbl 1055.05140.
28. DING, GUOLI; OPOROWSKI, BOGDAN. Some results on tree decomposition of graphs. J. Graph Theory 20 (1995), no. 4, 481-499. MR1358539 (96m:05053), Zbl 0837.05044.
29. DING, GUOLI; OPOROWSKI, BOGDAN. On tree-partitions of graphs. Discrete Math. 149 (1996), no. 1-3, 45-58. MR1375097 (97a:05168), Zbl 0844.05078.
30. DING, GUOLI; OPOROWSKI, BOGDAN; SANDERS, DANIEL P.; VERTIGAN, DIRK. Partitioning graphs of bounded tree-width. Combinatorica 18 (1998), no. 1, 1-12. MR1645638 (991:05162), Zbl 0924.05022.
31. DING, GUOLI; OPOROWSKI, BOGDAN; SANDERS, DANIEL P.; VERTIGAN, DIRK. Surfaces, treewidth, clique-minors, and partitions. J. Combin. Theory Ser. B 79 (2000), no. 2, 221-246. MR1769192 (20011:05059), Zbl 1029.05041.
32. DJIDJEV, HRISTO N.; VRT'O, IMRICH. Crossing numbers and cutwidths. J. Graph Algorithms Appl. 7 (2003), no. 3, 245-251. MR2112230 (2005h:05055), Zbl 1066.05054.
33. DJIDJEV, HRISTO N.; VRŤO, IMRICH. Planar crossing numbers of genus g graphs. Proc. SSrd International Colloquium on Automata, Languages and Programming (ICALP '06) (BUGLIESI, MICHELE; PRENEEL, BART; SASSONE, VLADIMIRO; WEGENER, INGO, eds.), Lecture Notes in Comput. Sci., 4051, 419-430. Springer, 2006.
34. DUJMOVIÓ, VIDA; MORIN, PAT; WOOD, DAVID R. Layout of graphs with bounded tree-width. SIAM J. Comput. 34 (2005), no. 3, 553-579. MR2137079 (2006a:05103), Zbl 1069.05055.
35. EDENBRANDT, ANDERS. Quotient tree partitioning of undirected graphs. BIT 26 (1986), no. 2, 148-155. MR0840323 (87g:05077), Zbl 0591.68070.
36. ERDÖS, PAUL; GUY, RICHARD K. Crossing number problems. Amer. Math. Monthly 80 (1973), 52-58. MR0382006, Zbl 0264.05109.
37. FÁRY, ISTVAN. On straight line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math. 11 (1948), 229-233. MR0026311 (10,136f), Zbl 0030.17902.
38. GARCIA-MORENO, ENRIQUE; SALAZAR, GELASIO. Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree. J. Graph Theory 36 (2001), no. 3, 168-173. MR1814533 (2001m:05093), Zbl 0979.05033.
39. GAREY, MICAHEL R.; JOHNSON, DAVID S. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4 (1983), no. 3, 312-316. MR0711340 (85a:68070), Zbl 0536.05016.
40. GEELEN, JAMES F.; RICHTER, R. BR.UCE; SALAZAR, GELASIO. Embedding grids in surfaces. European J. Combin. 25 (2004), no. 6, 785-792. MR2079898 (2005c:05057), Zbl 1050.05035.
41. n is as conjectured for n ≥ m(m + 1). J. Graph Theory 47 (2004), no. 1, 53-72. MR2079290 (2005c:05058), Zbl 1053.05032.
42. GROHE, MARTIN. Local tree-width, excluded minors, and approximation algorithms. Combinatorica 23 (2003), no. 4, 613-632. MR2046826 (2004m:05248), Zbl 1089.05503.
43. HALIN, RUDOLF. Tree-partitions of infinite graphs. Discrete Math. 97 (1991), 203-217. MR1140802 (93b:05044), Zbl 0763.05027.
44. HLINĚNY, PETR. Crossing-number critical graphs have bounded path-width. J. Combin. Theory Ser. B 88 (2003), no. 2, 347-367. MR1983364 (2004c:05060), Zbl 1021.05028.
45. HLINÈNÝ, PETR. Crossing number is hard for cubic graphs. J. Combin. Theory Ser. B 96 (2006), no. 4, 455-471. MR2232384 (2007c:05056), Zbl 1092.05016.
46. KAWARABAYASHI, KEN-ICHI; MOHAR, BOJAN. Some recent progress and applications in graph minor theory. Graphs Combin. 23 (2007), no. 1, 1-46.
47. KOSTOCHKA, ALEXANDR V. The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz. 38 (1982), 37-58. MR0713722 (85c:05018), Zbl 0544.05037.
48. LEAÑOS, JESÚS; SALAZAR, GELASIO. On the additivity of crossing numbers of graphs, 2006. http://www.ifisica.uaslp.mx/~gBalazaiyRESEARCH/additivity.pdf.
49. LEIGHTON, F. THOMSON. Complexity issues in VLSI. MIT Press, 1983. ISBN 0262121042.
50. LEIGHTON, F. THOMSON. New lower bound techniques for VLSI. Math. Systems Theory 17 (1984), no. 1, 47-70. MR0738751 (85d:68040), Zbl 0488.94048.
51. LOVÁSZ, LÁSZLÓ; VESZTERGOMBI, KATALIN; WAGNER, ULI; WELZL, EMO. Convex quadrilaterals and k-sets. In PACK [57], 139-148. MR.2065247 (2004m:05004), Zbl 1052.05004.
52. MOHAR, BOJAN; THOMASSEN, GARSTEN. Graphs on surfaces. Johns Hopkins University Press, Baltimore, U.S.A., 2001. MR1844449 (2002e:05050), Zbl 0979.05002.
53. MONTARON, BERNARD. An improvement of the crossing number bound. J. Graph Theory 50 (2005), no. 1, 43-54. MR2157537 (2006b:05047), Zbl 1073.05020.
54. m,n. Electron. J. Combin. 10 (2003), N8. MR2014536 (20041:05039), Zbl 1023.05039.
55. NEGAMI, SEIYA. Crossing numbers of graph embedding pairs on closed surfaces. J. Graph Theory 36 (2001), no. 1, 8-23. MR1803630 (2001m:05097), Zbl 0971.05037.
56. NEŠETŘIL, JAROSLAV; OSSONA DE MENDEZ, PATRICE. Grad and classes with bounded expan-sion I. Decompositions. European J. Combin. (in press). http://dx.doi.org/10.1016/j.ejc.2006.07.013.
57. PACH, JÁNOS, ed. Towards a theory of geometric graphs, Contemporary Mathematics, 342. Amer. Math. Soc., Providence, 2004. MR2065247 (2004m:05004), Zbl 1052.05004.
58. PACH, JÁNOS; RADOIǑIĆ, RADOS; TARDOS, GÁBOR; TÓTH, GÉZA. Improving the crossing lemma by finding more crossings in sparse graphs. Discrete Comput. Geom. 36 (2006), no. 4, 527-552. MR2267545, Zbl 1104.05022.
59. PACH, JÁNOS; SHAHROKHI, FARHAD; SZEGEDY, MARIO. Applications of the crossing number. Algorithmica 16 (1996), no. 1, 111-117. MR1394496 (97h:05054), Zbl 0851.68088.
60. PACH, JÁNOS; SHARIR, MICHA. On the number of incidences between points and curves. Combin. Probab. Comput. 7 (1998), no. 1, 121-127. MR1611057 (99b:52037), Zbl 0901.52016.
61. PACH, JÁNOS; TÓTH, GÉZA. Graphs drawn with few crossings per edge. Combinatorica 17 (1997), no. 3, 427-439. MR1606052 (99b:05043), Zbl 0902.05017.
62. PACH, JÁNOS; TÓTH, GÉZA. Which crossing number is it anyway? J. Combin. Theory Ser. B 80 (2000), no. 2, 225-246. MR1794693 (2001h:05034), Zbl 1023.05042.
63. PACH, JÁNOS; TÓTH, GÉZA. Crossing number of toroidal graphs. Proc. ISth International Symp. on Graph Drawing (GD '05) (HEALY, PATRICK; NLKOLOV, NIKOLA S., eds.), Lecture Notes in Comput. Sci., 3843, 334-342. Springer, Berlin, 2006. MR2244523.
64. PELSMAJER, MICHAEL J.; SCHAEFER, MARCUS; ŠTEFANKOVIĆ, DANIEL. Crossing number of graphs with rotation systems. Tech. Rep. 05-017, School of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago, U.S.A., 2005.
65. PURCHASE, HELEN. Which aesthetic has the greatest effect on human understanding? Proc. 5th International Symp. on Graph Drawing (GD '97) (DL BATTISTA, GLUSEPPE, ed.), Lecture Notes in Comput. Sci., 1353, 248-261. Springer, 1997.
66. PURCHASE, HELEN C. Performance of layout algorithms: Comprehension, not computation. J. Visual Languages and Computing 9 (1998), 647-657.
67. PURCHASE, HELEN C.; COHEN, ROBERT F.; JAMES, MURRAY I. An experimental study of the basis for graph drawing algorithms. ACM J. Experimental Algorithmics 2 (1997), no. 4. http://www.jea.acm.org/1997/PurchaseDrawing/.
68. REED, BRUCE A. Algorithmic aspects of tree width. Recent Advances in Algorithms and Combinatorics (REED, BRUCE A.; SALES, CLAUDIA L., eds.), 85-107. CMS Books Math./Ouvrages Math. SMC, 11, Springer, New York, 2003. MR1952984 (2003m:05199), Zbl 1035.05090.
69. 3,n in a surface. J. Graph Theory 21 (1996), no. 1, 51-54. MR1363689 (96i:05054), Zbl 0838.05033.
70. 5. Discrete Comput. Geom. 13 (1995), no. 2, 149-159. MR1314959 (95j:05081), Zbl 0820.05015.
71. RICHTER, R. BRUCE; THOMASSEN, CARSTEN. Relations between crossing numbers of complete and complete bipartite graphs. Amer. Math. Monthly 104 (1997), no. 2, 131-137. MR1437414 (98f:05054), Zbl 0872.05010.
72. RINGEL, GERHARD. Das Geschlecht des vollständigen paaren Graphen. Abh. Math. Sem. Univ. Hamburg 28 (1965), 139-150. MR0189012, Zbl 0132.21203.
73. RINGEL, GERHARD. Map color theorem. Springer-Verlag, 1974. MR0349461, Zbl 0287.05102.
74. m,n. Bull. Inst. Combin. Appl. 39 (2003), 16-20. MR1999850, Zbl 1048.05033.
75. ROBERTSON, NEIL; SANDERS, DANIEL P.; SEYMOUR, PAUL D.; THOMAS, ROBIN. The fourcolour theorem. J. Combin. Theory Ser. B 70 (1997), no. 1, 2-4. MR1441258 (98c:05065), Zbl 0883.05056.
76. ROBERTSON, NEIL; SEYMOUR, PAUL D. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7 (1986), no. 3, 309-322. MR0855559 (88c:05053), Zbl 0611.05017.
77. ROBERTSON, NEIL; SEYMOUR, PAUL D. Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B 89 (2003), no. 1, 43-76. MR1999736 (2004f:05168), Zbl 1023.05040.
78. ROBERTSON, NEIL; SEYMOUR, PAUL D. Graph minors. XX. Wagner's conjecture. J. Combin. Theory Ser. B 92 (2004), no. 2, 325-357. MR2099147 (2005m:05204), Zbl 1061.05088.
79. SCHEINERMAN, EDWARD R.; WLLF, HERBERT S. The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability. Amer. Math. Monthly 101 (1994), no. 10, 939-943. MR1304316 (95k:52006), Zbl 0834.05022.
80. SEESE, DETLEF. Tree-partite graphs and the complexity of algorithms. Proc. International Conf. on Fundamentals of Computation Theory (BUDACH, LOTHAR, ed.), Lecture Notes in Comput. Sci., 199, 412-121. Springer, Berlin, 1985. MR0821258, Zbl 0574.68036.
81. SEESE, DETLEF G.; WESSEL, WALTER. Grids and their minors. J. Combin. Theory Ser. B 47 (1989), no. 3, 349-360. MR1026069 (90j:05127), Zbl 0636.05023.
82. SHAHROKHI, FARHAD; SÝKORA, ONDREJ; SZÉKELY, LÁSZLÓ A.; VRŤO, IMRICH. The crossing number of a graph on a compact 2-manifold. Adv. Math. 123 (1996), no. 2, 105-119. MR1420482 (97h:05055), Zbl 0865.05036.
83. SHAHROKHI, FARHAD; SÝKORA, ONDREJ; SZÉKELY, LASZLO A.; VRTŤO, IMRICH. The gap between crossing numbers a,nd convex crossing numbers. In PACK [57], 249-258. MR2065268 (2005c:05064), Zbl 1062.05050.
84. SHAHROKHI, FARHAD; SZÉKELY, LÁSZLÓ A. On canonical concurrent flows, crossing number and graph expansion. Combin. Probab. Comput. 3 (1994), no. 4, 523-543. MR1314073 (961:05090), Zbl 0817.05022.
85. SHAHROKHI, FARHAD; SZÉKELY, ONDREJ, LÁSZLÓ A. SYKORA; VRTO, IMRICH. Drawings of graphs on surfaces with few crossings. Algorithmica 16 (1996), no. 1, 118-131. MR1394497 (97h:05056), Zbl 0854.68074.
86. SZÉKELY, LÁSZLÓ A. Crossing numbers and hard Erdos problems in discrete geometry. Cornbin. Probab. Comput. 6 (1997), no. 3, 353-358. MR1464571 (98h:52030), Zbl 0882.52007.
87. SZÉKELY, LÁSZLÓ A. A successful concept for measuring non-planarity of graphs: the crossing number. Discrete Math. 276 (2004), no. 1-3, 331-352. MR2046646 (2005a:05073), Zbl 1035.05034.
88. TAIT, PETER GUTHRIE. Note on a theorem in geometry of position. Trans. Roy. Soc. Edinburgh 29 (1880), 657-660.
89. THOMASON, ANDREW. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95 (1984), no. 2, 261-265. MR0735367 (851:05141), Zbl 0551.05047.
90. THOMASON, ANDREW. The extremal function for complete minors. J. Combin. Theory Ser. B 81 (2001), no. 2, 318-338. MR1814910 (2002i:05100), Zbl 1024.05083.
91. VRŤO, IMRICH. Crossing numbers of graphs: A bibliography (2007). ftp://ftp.ifi.savba.sk/pub/imrich/crobib.pdf.
92. WAGNER, KLAUS. Bemerkung zum Vierfarbenproblem. Jber. Deutsch. Math.-Verein. 46 (1936), 26-32.
93. WAGNER, KLAUS. Über eine Eigenschaft der ebene Komplexe. Math. Ann. 114 (1937), 570590. MR1513158, Zbl 0017.19005.
94. WOOD, DAVID R. Vertex partitions of chordal graphs. J. Graph Theory 53 (2006), no. 2, 167-172. MR2255760.
95. WOOD, DAVID R. A note on tree-partition-width (2007). arXiv:math/0602507.
96. WOOD, DAVID R.; TELLE, JAN ARNE. Planar decompositions and the crossing number of graphs with an excluded minor (2006). arXiv:math/0604467. http://nyjm.albany.edu/j/2007/13-8. html.