메뉴 건너뛰기




Volumn 97, Issue 4, 2007, Pages 647-651

A relaxed Hadwiger's Conjecture for list colorings

Author keywords

Hadwiger's Conjecture; List coloring

Indexed keywords


EID: 34247884458     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2006.11.002     Document Type: Article
Times cited : (59)

References (18)
  • 1
    • 84972498411 scopus 로고
    • Every planar map is four colorable, Part I. Discharging
    • Appel K., and Haken W. Every planar map is four colorable, Part I. Discharging. Illinois J. Math. 21 (1977) 429-490
    • (1977) Illinois J. Math. , vol.21 , pp. 429-490
    • Appel, K.1    Haken, W.2
  • 2
    • 84972500815 scopus 로고
    • Every planar map is four colorable, Part II. Reducibility
    • Appel K., Haken W., and Koch J. Every planar map is four colorable, Part II. Reducibility. Illinois J. Math. 21 (1977) 491-567
    • (1977) Illinois J. Math. , vol.21 , pp. 491-567
    • Appel, K.1    Haken, W.2    Koch, J.3
  • 3
    • 34247848644 scopus 로고    scopus 로고
    • T. Böhme, K. Kawarabayashi, J. Maharry, B. Mohar, Linear connectivity forces large complete bipartite minors, submitted for publication
  • 5
    • 84883316196 scopus 로고
    • A property of 4-chromatic graphs and some remarks on critical graphs
    • Dirac G.A. A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 (1952) 85-92
    • (1952) J. London Math. Soc. , vol.27 , pp. 85-92
    • Dirac, G.A.1
  • 7
    • 34247876881 scopus 로고    scopus 로고
    • K. Kawarabayashi, Minors in 7-chromatic graphs, preprint
  • 8
    • 34247859966 scopus 로고    scopus 로고
    • K. Kawarabayashi, B. Mohar, Algorithmic aspect of Hadwiger's conjecture, submitted for publication
  • 9
    • 33748108623 scopus 로고    scopus 로고
    • K. Kawarabayashi, B. Mohar, Approximating the chromatic number and the list-chromatic number of minor-closed family of graphs and odd-minor-closed family of graphs, in: Proceedings of the 38th ACM Symposium on Theory of Computing (STOC'06), 2006, pp. 401-416
  • 11
    • 0002144725 scopus 로고
    • The minimum Hadwiger number for graphs with a given mean degree of vertices
    • (in Russian)
    • Kostochka A. The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz. 38 (1982) 37-58 (in Russian)
    • (1982) Metody Diskret. Analiz. , vol.38 , pp. 37-58
    • Kostochka, A.1
  • 12
    • 51249184988 scopus 로고
    • Lower bound of the Hadwiger number of graphs by their average degree
    • Kostochka A. Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4 (1984) 307-316
    • (1984) Combinatorica , vol.4 , pp. 307-316
    • Kostochka, A.1
  • 15
    • 84976013923 scopus 로고
    • An extremal function for contractions of graphs
    • Thomason A. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95 (1984) 261-265
    • (1984) Math. Proc. Cambridge Philos. Soc. , vol.95 , pp. 261-265
    • Thomason, A.1
  • 16
    • 0012819185 scopus 로고    scopus 로고
    • The extremal function for complete minors
    • Thomason A. The extremal function for complete minors. J. Combin. Theory Ser. B 81 (2001) 318-338
    • (2001) J. Combin. Theory Ser. B , vol.81 , pp. 318-338
    • Thomason, A.1
  • 17
    • 18844429284 scopus 로고    scopus 로고
    • A survey of Hadwiger's conjecture
    • Toft B. A survey of Hadwiger's conjecture. Congr. Numer. 115 (1996) 249-283
    • (1996) Congr. Numer. , vol.115 , pp. 249-283
    • Toft, B.1
  • 18
    • 33845337775 scopus 로고
    • Über eine Eigenschaft der ebenen Komplexe
    • Wagner K. Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114 (1937) 570-590
    • (1937) Math. Ann. , vol.114 , pp. 570-590
    • Wagner, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.