论文信息 - Hadwiger's conjecture for quasi-line graphs

Hadwiger's conjecture for quasi-line graphs

A graph G is a quasi-line graph if for every vertex v ∈ V(G), the set of neighbors of v in G can be expressed as the union of two cliques. The class of quasi-line graphs is a proper superset of the class of line graphs. Hadwiger's conjecture states that if a graph G is not t-colorable then it contains Kt + 1 as a minor. This conjecture has been proved for line graphs by Reed and Seymour. We extend their result to all quasi-line graphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 17–33, 2008 This research was conducted while the author served as a Clay Mathematics Institute Research Fellow. Part of the research was conducted at Princeton University.

Maria Chudnovsky | Alexandra Fradkin

[1] K. Appel,et al. Every planar map is four colorable. Part II: Reducibility , 1977 .

[2] D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[3] K. Menger. Zur allgemeinen Kurventheorie , 1927 .

[4] Paul D. Seymour,et al. The structure of claw-free graphs , 2005, BCC.

[5] K. Wagner. Über eine Eigenschaft der ebenen Komplexe , 1937 .

[6] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .

[7] Maria Chudnovsky,et al. Coloring quasi-line graphs , 2007 .

[8] Robin Thomas,et al. Hadwiger's conjecture forK6-free graphs , 1993, Comb..

[9] Bruce A. Reed,et al. Hadwiger's conjecture for line graphs , 2004, Eur. J. Comb..

[10] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[11] Paul D. Seymour,et al. Claw-free graphs. II. Non-orientable prismatic graphs , 2008, J. Comb. Theory, Ser. B.