A separator theorem for string graphs and its applications

Combinatorics Probability and Computing

Volumn 19, Issue 3, 2010, Pages 371-390

  Fox, Jacob ^a   Pach, János ^b,c  

^a Department of Mathematics ^*  (United States)

^b EPFL   (Switzerland)

^c ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EQUAL SIZES; INTERSECTION GRAPH; SEPARATOR THEOREMS; STRING GRAPHS; SUBGRAPHS;

TREES (MATHEMATICS);

EID: 77951258291     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548309990459     Document Type: Article

References (39)

1. Alon, N., Seymour, P. and Thomas, R. (1990) A separator theorem for nonplanar graphs. J. Amer. Math. Soc. 3 801-808.
2. Alon, N. and Spencer, J. (2000) The Probabilistic Method, 2nd edn, Wiley.
3. Bollob́ as, B. (1998) Modern Graph Theory, Springer.
4. Böttcher, J., Pruessmann, K. P., Taraz, A. andWürfl, A. (2008) Bandwidth, treewidth, separators, expansion, and universality. In Proc. Topological. and Geometric Graph Theory (TGGT 08), Electron. Notes. Discrete Math. 31 91-96.
5. Capoyleas, V. and Pach, J. (1992) A Tuŕ an-type theorem on chords of a convex polygon. J. Combin. Theory Ser. B 56 9-15.
6. Chung, F. (1988) Labelings of graphs. In Selected Topics in Graph Theory, Academic Press, San Diego, pp. 151-168.
7. Diestel, R. (2000) Graph Theory, 2nd edn, Springer.
8. Dvoř́ak, Z. and Norine, S. Small graph classes and bounded expansion. J. Combin. Theory Ser. B, to appear.
9. Erdös, P. (1959) Graph theory and probability. Canad. J. Math. 11 34-38.
10. Fox, J. (2006) A bipartite analogue of Dilworth's theorem. Order 23 197-209.
11. Fox, J. and Pach, J. (2008) Separator theorems and Tur ́ an-type results for planar intersection graphs. Adv. Math. 219 1070-1080.
12. Fox, J. and Pach, J. (2008) Coloring Kk-free intersection graphs of geometric objects in the plane. In Proc. 24th ACM Sympos. on Computational Geometry, ACM Press, New York, pp. 346-354.
13. Fox, J. and Pach, J. String graphs and incomparability graphs. Submitted.
14. Fox, J., Pach, J. and Tó th, C. D. Intersection patterns of curves. J. London Math. Soc., to appear.
15. Fox, J., Pach, J. and Tó th, C. D. Turán-type results for partial orders and intersection graphs of convex sets. Israel J. Math, to appear.
16. Gilbert, J. R., Hutchinson, J. P. and Tarjan, R. E. (1984) A separator theorem for graphs of bounded genus. J. Algorithms 5 391-407.
17. Koebe, P. (1936) Kontaktprobleme der konformen Abbildung. Berichte über die Verhandlungen der Sachsischen Akademie der Wissenschaften, Leipzig, Mathematische-Physische Klasse 88 141-164.
18. Kolman, P. and Matoušek, J. (2004) Crossing number, pair-crossing number, and expansion. J. Combin. Theory Ser. B 92 99-113.
19. Kostochka, A. V. and Nešetřil, J. (1998) Coloring relatives of intervals on the plane I: Chromatic number versus girth. Europ. J. Combin. 19 103-110.
20. Knopp, K. (1956) Infinite Sequences and Series, Dover, New York.
21. Kratochv́il, J. and Matoušek, J. (1989) NP-hardness results for intersection graphs. Comment. Math. Univ. Carolin. 30 761-773.
22. Kratochv́il, J. and Matoušek, J. (1994) Intersection graphs of segments. J. Combin. Theory Ser. B 62 289-315.
23. Kühn, D. and Osthus, D. (2004) Induced subdivisions in Ks,s-free graphs of large average degree. Combinatorica 24 287-304.
24. Leighton, T. and Rao, S. (1999) Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. Assoc. Comput. Mach. 46 787-832.
25. Lipton, R. J., Rose, D. J. and Tarjan, R. E. (1979) Generalized nested dissection. SIAM J. Numer. Anal. 16 346-358.
26. Lipton, R. J. and Tarjan, R. E. (1979) A separator theorem for planar graphs. SIAM J. Appl. Math. 36 177-189.
27. Lipton, R. J. and Tarjan, R. E. (1980) Applications of a planar separator theorem. SIAM J. Comput. 9 615-627.
28. McDiarmid, C., Steger, A. and Welsh, D. (2005) Random planar graphs. J. Combin. Theory Ser. B 93 187-206.
29. Miller, G. L., Teng, S.-H., Thurston, W. and Vavasis, S. A. (1997) Separators for sphere-packings and nearest neighbor graphs. J. Assoc. Comput. Mach. 44 1-29.
30. Norine, S., Seymour, P., Thomas, R. and Wollan, P. (2006) Proper minor-closed families are small. J. Combin. Theory Ser. B 96 754-757.
31. Pach, J. and Agarwal, P. (1995) Combinatorial Geometry, Wiley, New York.
32. Pach, J., Pinchasi, R., Sharir, M. and Tó th, G. (2005) Topological graphs with no large grids. Graphs Combin. 21 355-364.
33. Pach, J., Shahrokhi, F. and Szegedy, M. (1996) Applications of the crossing number. Algorithmica 16 111-117.
34. Pach, J. and Sharir, M. (2009) On planar intersection graphs with forbidden subgraphs. J. Graph Theory 59 205-214.
35. Pach, J. and Tó th, G. (2000) Which crossing number is it anyway? J. Combin. Theory Ser. B 80 225-246.
36. Pach, J. and Tó th, G. (2006) Comment on Fox News. Geombinatorics 15 150-154.
37. Preparata, F. and Shamos, M. (1985) Computational geometry: An Introduction, Texts and Monographs in Computer Science, Springer, New York.
38. Radoičić , R. and Tó th, G. (2008) The discharging method in combinatorial geometry and its application to Pach-Sharir conjecture on intersection graphs. In Proc. Joint Summer Research Conference on Discrete and Computational Geometry (J. E. Goodman, J. Pach and J. Pollack, eds), Vol.453 of Contemporary Mathematics, AMS, pp. 319-342.
39. Thomassen, C. (1983) Girth in graphs. J. Combin. Theory Ser. B 35 129-141.