A charming class of perfectly orderable graphs

DOI10.1016/0012-365X(92)90348-JzbMath0776.05091MaRDI QIDQ1193431

Chính T. Hoàng, Stephan Olariu, Myriam Preissmann, Frédéric Maffray

Publication date: 27 September 1992

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

zbMATH Keywords

perfect graphscoloringgreedy algorithmscharming graphsperfectly orderable graphscharming orderingcharming vertex

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Weighted independent sets in classes of \(P_6\)-free graphs, A note on perfectly orderable graphs, Meyniel weakly triangulated graphs. II: A theorem of Dirac, Weighted parameters in \((P_5,\overline {P_5})\)-free graphs, Meyniel weakly triangulated graphs. I: Co-perfect orderability

Cites Work

• Unnamed Item
• Unnamed Item
• Which claw-free graphs are perfectly orderable?
• Topics on perfect graphs
• Weakly triangulated graphs
• On the complexity of recognizing perfectly orderable graphs
• Which line-graphs are perfectly orderable?
• On brittle graphs
• Four classes of perfectly orderable graphs