Coloring triangle-free graphs on surfaces. Extended abstract

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 120-129

  Dvořák, Zdeněk ^a   Král, Daniel ^a   Thomas, Robin ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

3-COLORABILITY; 3-COLORING; CHROMATIC NUMBER; DISJOINT PATHS; EXTENDED ABSTRACTS; FIXED SURFACES; LINEAR TIME; LINEAR-TIME ALGORITHMS; POLYNOMIAL-TIME; QUADRATIC TIME; SUBGRAPHS; TOPOLOGICAL OBSTRUCTIONS; TRIANGLE-FREE GRAPHS; WEIGHTED GRAPH; WINDING NUMBER;

CLUSTERING ALGORITHMS; COLORING; DATA STRUCTURES; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 70349089684     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. J. A. Bondy and U. S. R. Murty, Graph theory with applications, North-Holland, New York, Amsterdam, Oxford, 1976.
2. S. Cabello and B. Mohar, Finding shortest non-separating and non-contractible cycles for topologically embedded graphs, Discrete Comput. Geom., 37 (2007), pp. 213-235.
3. Z. Dvořák, K. Kawarabayashi and R. Thomas, Three-coloring triangle-free planar graphs in linear time, to appear in the proc. of SODA 2009.
4. D. Eppstein, Subgraph isomorphism in planar graphs and related problems, J. Algor. and Appl., 3 (1999), pp. 1-27.
5. S. Fisk, The nonexistence of colorings, J. Combin. Theory Ser. B, 24 (1978), pp. 247-248.
6. T. Gallai, Kritische Graphen I, Publ. Math. Inst. Hungar. Acad. Sci., 8 (1963), pp. 165-192.
7. T. Gallai, Kritische Graphen II, Publ. Math. Inst. Hungar. Acad. Sci., 8 (1963), pp. 373-395.
8. M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness, W. H. Freeman, San Francisco, 1979.
9. J. Gimbel and C. Thomassen, Coloring graphs with fixed genus and girth, Trans. Amer. Math. Soc., 349 (1997), pp. 4555-4564. (Pubitemid 127745334)
10. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe, 8 (1959), pp. 109-120.
11. J. Hutchinson, Three-coloring graphs embedded on surfaces with all faces even-sided, J. Combin. Theory Ser. B, 65 (1995), pp. 139-155.
12. P. J. Heawood, Map-color theorem, Quart. J. Pure Appl. Math., 24 (1890), pp. 332-338.
13. K. Kawarabayashi and K. Kobayashi, An algorithm for finding an induced cycle in planar graphs and bounded genus graphs, to appear in the proc. of SODA 2009.
14. Ł. Kowalik, Fast 3-coloring triangle-free planar graphs, ESA 2004, Lecture Notes in Comput. Sci., 3221 (2004), pp. 436-447.
15. L. Kowalik, M. Kurowski: Short path queries in planar graphs in constant time, STOC 2003, pp. 143-148.
16. B. Mohar and P. D. Seymour, Coloring locally bipartite graphs on surfaces, J. Combin. Theory Ser. B, 84 (2002), pp. 301-310.
17. B. Mohar and C. Thomassen, Graphs on surfaces, Johns Hopkins University Press, Baltimore, MD, 2001.
18. A. Nakamoto, S. Negami and K. Ota, Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces, Discrete Math., 285 (2004), pp. 211-218.
19. J. Nešetřil, P. Ossona de Mendez: Linear time low tree-width partitions and algorithmic consequences, STOC 2006, pp. 391-400. (Pubitemid 44306574)
20. J. Nešetřil, P. Ossona de Mendez: Grad and classes with bounded expansion I. Decompositions, Europ. J. Combin., 29 (2008), pp. 760-776.
21. J. Nešetřil, P. Ossona de Mendez: Grad and classes with bounded expansion II. Algorithmic aspects, Europ. J. Combin., 29 (2008), pp. 777-791.
22. B. Reed, Rooted routing in the plane, Discrete Appl. Math., 57 (1995), pp. 213-227.
23. B. A. Reed, N. Robertson, A. Schrijver and P. D. Seymour, Finding disjoint trees in planar graphs in linear time, Contemp. Math., 147 (1993), pp. 295-301.
24. G. Ringel, Map Color Theorem, Springer-Verlag, Berlin, 1974.
25. G. Ringel and J. W. T. Youngs, Solution of the Heawood map-coloring problem, Proc. Nat. Acad. Sci. U.S.A., 60 (1968), pp. 438-445.
26. N. Robertson and P. D. Seymour, Graph Minors VI. Disjoint paths across a disc, J. Combin. Theory Ser. B, 41 (1986), pp. 115-138.
27. N. Robertson and P. D. Seymour, Graph Minors VII. Disjoint paths on a surface, J. Combin. Theory Ser. B, 45 (1988), pp. 212-254.
28. H. Suzuki, T. Akama and T. Nishiseki, An algorithm for fidning a forest in a planar graph - case in which a net may have terminals on the two specified face boundaries, Electron. Comm. Japan Part III Fund Electron. Sci, 72 (1989), pp. 68-79.
29. C. Thomassen, Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane, J. Combin. Theory Ser. B, 62 (1994), pp. 268-279.
30. C. Thomassen, Color-critical graphs on a fixed surface, J. Combin. Theory Ser. B, 70 (1997), pp. 67-100.
31. C. Thomassen, The chromatic number of a graph of girth 5 on a fixed surface, J. Combin. Theory Ser. B, 87 (2003), pp. 38-71. (Pubitemid 36269960)
32. D. A. Youngs, 4-chromatic projective graphs, J. Graph Theory, 21 (1996), pp. 219-227.