The Erdős-Lovász tihany conjecture for quasi-line graphs

DOI10.1016/j.disc.2008.11.016zbMath1184.05039OpenAlexW2077540608WikidataQ123309805 ScholiaQ123309805MaRDI QIDQ1043565

Michael Stiebitz, Alexandr V. Kostochka, Noah Prince, József Balogh

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.11.016

zbMATH Keywords

graph coloringindependence numberclique numberquasi-line graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

Some remarks on even-hole-free graphs ⋮ Hadwiger's Conjecture for Graphs with Forbidden Holes ⋮ Clique coverings and claw-free graphs ⋮ Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs ⋮ Partition line graphs of multigraphs into two subgraphs with large chromatic numbers ⋮ Double-critical graph conjecture for claw-free graphs ⋮ Erdős-Lovász Tihany conjecture for graphs with forbidden holes ⋮ Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers ⋮ A Relaxed Version of the Erdős–Lovász Tihany Conjecture

Cites Work

• Unnamed Item
• Partitions and edge colourings of multigraphs
• \(K_ 5\) is the only double-critical 5-chromatic graph
• Claw-free graphs. VII. Quasi-line graphs
• Coloring quasi-line graphs
• Hadwiger's conjecture for quasi-line graphs
• On odd circuits in chromatic graphs
• 25 pretty graph colouring problems

This page was built for publication: The Erdős-Lovász tihany conjecture for quasi-line graphs