A new characterization of trivially perfect graphs

DOI10.5614/ejgta.2015.3.1.3zbMath1467.05088OpenAlexW1533615781MaRDI QIDQ5006549

Christian Rubio-Montiel

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2015.3.1.3

zbMATH Keywords

perfect graphsGrundy numbercomplete coloringforbidden graph characterization

Mathematics Subject Classification ID

Perfect graphs (05C17)

Related Items (4)

On graphs with 2 trivial distance ideals ⋮ The Hadwiger number, chordal graphs and \(ab\)-perfection ⋮ On the Grundy number of Cameron graphs ⋮ Distance ideals of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Some perfect coloring properties of graphs
• Trivially perfect graphs
• Quasi-threshold graphs
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• The Comparability Graph of a Tree
• A Note on "The Comparability Graph of a Tree"
• Graph colourings and partitions

This page was built for publication: A new characterization of trivially perfect graphs