A charming class of perfectly orderable graphs

DOI10.1016/0012-365X(92)90348-JMaRDI QIDQ1193431zbMATH OpenFDO

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

Publication date 27 September 1992

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmscoloringperfect graphsperfectly orderable graphscharming 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)

Recommendations

• Meyniel weakly triangulated graphs. I: Co-perfect orderability
• Four classes of perfectly orderable graphs
• Properly orderable graphs
• scientific article; zbMATH DE number 817188
• New classes of perfectly orderable graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3891425 (Why is no real title available?)
• Four classes of perfectly orderable graphs
• On brittle graphs
• On the complexity of recognizing perfectly orderable graphs
• Topics on perfect graphs
• Weakly triangulated graphs
• Which claw-free graphs are perfectly orderable?
• Which line-graphs are perfectly orderable?

Cited in

(6)

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

This page was built for publication: A charming class of perfectly orderable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193431)