Journal of Graph Theory · 2008 · 21 citations · 6 references
Natural SciencesMathematicsColor TheoryCombinatoricsTopologyDirected Acyclic GraphsGraph AlgorithmsGraph ColoringGraph TheoryGraph MinorsGraph Theory AnalysisGraph Theory ModelsLine Graphs
Abstract 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 K t + 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
6
Hadwiger's conjecture forK 6-free graphs
Neil Robertson, Paul Seymour, Robin Thomas · COMBINATORICA · 1993 · 290 citations
Hadwiger’s conjecture for line graphs
Bruce Reed, Paul Seymour · European Journal of Combinatorics · 2004 · 42 citations