Maximal ambiguously \(k\)-colorable graphs

DOI10.1016/j.jctb.2019.05.007zbMath1430.05040arXiv1502.03555OpenAlexW2963235717WikidataQ127652980 ScholiaQ127652980MaRDI QIDQ2284731

Matthias Kriesell

Publication date: 15 January 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03555

zbMATH Keywords

coloringambiguously colorableTurán-type theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Perfect product graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Algebraic characterization of uniquely vertex colorable graphs
• A characterization of perfect graphs
• Hadwiger’s Conjecture
• Unique Colorability and Clique Minors