The Hadwiger number, chordal graphs and \(ab\)-perfection

DOI10.1016/j.akcej.2017.02.004zbMath1372.05082arXiv1701.08417OpenAlexW2585060781MaRDI QIDQ2409752

Christian Rubio-Montiel

Publication date: 13 October 2017

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

perfect graphscomplete coloringsforbidden graphs characterization

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The achromatic number of Kneser graphs
• On rigid circuit graphs
• The strong perfect graph theorem
• Some perfect coloring properties of graphs
• Perfect graphs of strong domination and independent strong domination
• Characterization of \(b\gamma\)-perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• A new characterization of trivially perfect graphs
• Graph colourings and partitions

This page was built for publication: The Hadwiger number, chordal graphs and \(ab\)-perfection