Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 401-416

  Kawarabayashi, Ken Ichi ^a,c   Mohar, Bojan ^b,d  

^a TOHOKU UNIVERSITY   (Japan)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

^c NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^d SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Graph coloring; Graph minor; Hadwiger Conjecture; List coloring; Odd minor

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

GRAPH COLORING; GRAPH MINOR; HADWIGER CONJECTURE; LIST COLORING; ODD MINOR;

GRAPH THEORY;

EID: 33748108623     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132576     Document Type: Conference Paper

References (75)

1. K. Appel and W. Haken. Every planar map is four colorable, part I. Discharging. Illinois J. Math., 21:429-490, 1977.
2. K. Appel, W. Haken, and J. Koch. Every planar map is four colorable, part II. Reducibility. Illinois J. Math., 21:491-567, 1977.
3. S. Arnborg and S. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math., 23:11-24, 1989.
4. M. Biró, M. Hujter, and Z. Tuza. Precoloring extension I, interval graphs. Discrete Math., 100:267-279, 1990.
5. M. Biró, M. Hujter, and Z. Tuza. Cross fertilisation of graph theory and aircraft maintenace scheduling. In Thirty-Second Annual Symposium (G. Davison, ed.), AGIFORS (Airline Group of the international Federation of Operational Research), pages 307-317, 1993.
6. 3/14)-coloring algorithm for 3-colorable graphs. Information Processing Letters, 61(1):49-53, 1997.
7. H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305-1317, 1996.
8. H. L. Bodlaender, K. Jansen, and G. J. Woeginger. Scheduling with incompatible jobs. Discrete Applied Math., 55:219-232, 1994.
9. T. Böhme, K. Kawarabayashi, J. Maharry, and B. Mohar. Linear connectivity forces large complete bipartite minors. To appear in J. Combin. Theory Ser B.
10. B. Bollobás and A. Thomason. Highly linked graphs. Combinatorica, 16:313-320, 1996.
11. P. A. Catlin. A bound on the chromatic number of a graph. Discrete Math., 22:81-83, 1978.
12. 1 norm. In Proceedings of the 43th Annual Symposium on Foundations of Computer Science (FOCS'02), pages 551-560, 2002.
13. G. Chartrand, D. Geller, and T. Hedetniemi. Graphs with forbidden subgraphs. J. Combin. Theory, 10:12-41, 1971.
14. G. Chartrand and H. V. Kronk, The point-arboricity of planar graphs. J. London Math. Soc., 44:612-616, 1969.
15. 1. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '03), pages 527-536, 2003.
16. Z.-Z. Chen. NC algorithms for partitioning sparse graphs into induced forests with an application. In Proc. 6th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1004, Springer, Berlin, pages 428-437, 1995.
17. Z.-Z. Chen. Efficeint algorithms for acyclic coloring graphs. Theoretical Computer Scienece, 230:79-95, 2000.
18. Z.-Z. Chen and X. He. Parallen complexity of partitioning a planar graph into vertex-induced forests. Discrete Applied Math., 69:183-198, 1996.
19. W. Cunningham and A. Marsh. A primal algorithm for optimum matching. In Polyhedral Combinatorics, (dedicated to the memory of D. R. Fulkerson), Eds: M. L. Balinski and A. J. Huffman, Math. Programming Sud. No. 8, North-Holland, Amsterdam, pages 60-72, 1978.
20. E. D. Demaine, M. Hajiaghayi, and K. Kawarabayashi. Algorithmic graph minor theory: Decomposition, approximation, and coloring. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 637-646, Pittsburgh, PA, October 2005.
21. G. Ding, B. Oporowski, D. Sander, and D. Vertigan. Surface, tree-width, clique-minors, and partitions. J. Combin. Theory Ser. B, 79:221-246, 2000.
22. G. Dirac. A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc., 27:85-92, 1952.
23. P. Erdos, Rubin, and Taylor. Choosability in graphs. In Proc. West-Coast conference on Combinatorics Graph Theory and Computing, Arcata Califonia, Congressus Numerantium, volume XXVI, pages 125-157, 1979.
24. U. Feige and J. Kilian. Zero-knowledge and the chromatic number. J. Comput. System Sci., 57:187-199, 1998.
25. M. R. Fellows and M. A. Langston. Nonconstructive tools for proving polynomial-time decidability. Journal of the ACM, 35:727-739, 1988.
26. H. Gabow. Implementation of algorithms for maximum matching on non-bipartite graphs. Ph. D. Stanford University, Dep. Comput. 1973.
27. Z, Galil, S. Micali, and H. Gabow. Priority queues with variable priority and an o(ev log v) algorithm for finding a maximal weighted matching in general graohs. In 23rd Annual Sumposium on Foundations of Computer Science (Chicago), pages 255-261, 1982.
28. J. Geelen, B. Gerards, L. Goddyn, B. Reed, P. Seymour, and A. Vetta. The odd case of Hadwiger's conjecture. Submitted.
29. J. Geelen and B. Guenin. Packing odd circuits in eulerian graphs. J. Combin. Theory Ser. B, 86:280-295, 2002.
30. W. Goddard. Acyclic coloring of planar graphs. Discrete Math, 91:91-94, 1991.
31. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization, Combinatorial, 1:169-197, 1981.
32. M. Grötschel and W. Pullyblank. Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett., 1:23-27, 1981.
33. B. Guenin. A characterization of weakly bipartite graphs. In Integer Programming and Combinatorial optimizaition, Proceedings, 6th IPCO conference, Houston, Texas, 1998, (R.E. Bixby et al, Eds), Lecture Notes in Computer Science, Springer- Verlag, Berlin, volume 1412, pages 9-22.
34. B. Guenin. A characterization of weakly bipartite graphs. J. Combin. Theory Ser. B, 83:112-168, 2001.
35. B. Guenin. Talk at Oberwolfach on graph theory. Jan. 2005.
36. 1-embeddings of graphs. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS'99), pages 399-409, 1999.
37. S. Gutner. The complexity of planar graph choosability. Discrete Math., 159:119-130, 1996.
38. H. Hadwiger. Über eine Klassifikation der Streckenkomplexe. In Vierteljahrsschr. naturforsch. Ges. Zürich, volume 88, pages 133-142, 1943.
39. 1-ε. Acta Math., 182:105-142, 1999.
40. M. Henzinger, S. Rao, and H. Gabow. Computing vertex connectivity: New bounds from old techniques. J. Algorithms, 34:222-250, 2000.
41. T. R. Jensen and B. Toft. Graph Coloring Problems. Wiley-Interscience, 1995.
42. K. Kawarabayashi. Linkage problem and its application to hadwiger's conjecture, preprint.
43. K. Kawarabayashi. Minors in 7-chromatic graphs. Preprint.
44. K. Kawarabayashi. On the connectivity of minimal counterexamples to Hadwiger's conjecture. To appear in J. Combin. Theory Ser. B.
45. K. Kawarabayashi, A. Kostochka, and G. Yu. On sufficient degree conditions for a graph to be k-linked. To appear in Combin. Probab. Comput.
46. K. Kawarabayashi and B. Mohar. Algorithmic aspects of Hadwiger's conjecture. Submitted.
47. K. Kawarabayashi and B. Mohar. A relaxed Hadwiger's conjecture for list colorings. To appear in J. Combin. Theory Ser. B.
48. K. Kawarabayashi and B. Reed, Highly parity linked graphs. To appear in Combinatorica.
49. K. Kawarabayashi and Z. Song. Some remarks on the odd hadwiger's conjecture. To appear in Combinatorica.
50. 4,4 as a minor. Combinatorica, 25:327-353, 2005.
51. K. Kawarabayashi and P. Wollan, Non-zero disjoint cycles in highly connected group-labelled graphs. J. Combin. Theory Ser. B, 96:296-301, 2006.
52. P. N. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC'93), pages 682-690, 1993.
53. A, Kostochka. The minimum Hadwiger number for graphs with a given mean degree of vertices (in Russian). Metody Diskret. Analiz., 38:37-58, 1982.
54. A. Kostochka. Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica, 4:307-316, 1984.
55. E. Lawler. Combinatorial optimization; Networks and Matroids. Holt, Rinehart and Wilson, New York, 1976.
56. W. Mader. Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend grosser Kantendichte. Abh. Math. Sem. Univ. Hamburg, 37:86-97, 1972.
57. S. A. Plotkin, S. Rao, and W. D. Smith. Shallow excluded minors and improved graph decompositions. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '94), pages 462-470, 1994.
58. N. Robertson, D. P. Sanders, P. D. Seymour, and R. Thomas. The four-color theorem. J. Combin. Theory Ser. B, 70:2-44, 1997.
59. N. Robertson and P. D. Seymour. Graph minors XIII. The disjoint paths problems. J. Combin. Theory Ser. B, 63:65-110, 1995.
60. N. Robertson and P. D. Seymour. Graph minors. XVII. Taming a vortex. J. Combin. Theory Ser. B, 77:162-210, 1999.
61. N. Robertson and P. D. Seymour. Graph minors, XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B, 89:43-76, 2003.
62. 6-free graphs. Combinatorica, 13:279-361, 1993.
63. A. Roychoudhury and S. Sur-Kolay. Efficient algorithm for vertex arboricity of planar graphs. In Proc. 15th Internat. Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Springer, Berlin, volume 1026, pages 37-51, 1995.
64. A. Schrijver. A short proof of Guenin's characterization of weakly bipartite graphs. J. Combin. Theory Ser. B, 85:255-260, 2002.
65. P. D. Seymour. The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B, 23:189-222, 1977.
66. R. Thomas and P. Wollan. An improved linear edge bound for graph linkages. Europ. J. Combin., 26:309-324, 2005.
67. A. Thomason. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc., 95:261-265, 1984.
68. A. Thomason. The extremal function for complete minors. J. Combin. Theory Ser. B, 81:318-338, 2001.
69. C. Thomassen. Every planar graph is 5-choosable. J. Combin. Theory Ser. B, 62:180-181, 1994.
70. B. Toft. A survey of Hadwiger's conjecture. Congr. Numer., 115:249-283, 1996.
71. Z. Tuza. Graph colorings with local constraints - a survey, Discuss. Math. Graph Theory, 17:161-228, 1997.
72. V. G. Vizing. Coloring the vertices of a graph in prescribed colors. Metody Diskret. Anal, v Teorii Kodov i Sehem (In Russian), 29:3-10, 1976.
73. M. Voigt. List colourings of planar graphs. Discrete Math., 120:215-219, 1993.
74. K. Wagner. Über eine Eigenschaft der ebenen Komplexe. Math. Ann., 114:570-590, 1937.
75. D. R. Woodall. Improper colourings of graphs. In Graph Colourings (ed. R. Nelson and R. J. Wilson), Pitman Research Notes, Longman, volume 218, pages 45-63, 1990.