On a conjecture of Hoàng and Tu concerning perfectly orderable graphs

DOI10.1016/J.DISC.2005.09.023zbMATH Open1106.05092OpenAlexW1977638440WikidataQ123365373 ScholiaQ123365373MaRDI QIDQ860461FDOQ860461

Authors: Stefan Hougardy 

Publication date: 9 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.023

Recommendations

• On the perfect orderability of unions of two graphs
• All variations on perfectly orderable graphs
• Meyniel weakly triangulated graphs. I: Co-perfect orderability
• On the structure of bull-free perfect graphs. II: The weakly chordal case
• Counterexamples to three conjectures concerning perfect graphs

zbMATH Keywords

weakly triangulated graph

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Weakly triangulated graphs
• Meyniel weakly triangulated graphs. I: Co-perfect orderability
• Topics on perfect graphs
• On the perfect orderability of unions of two graphs

Cited In (3)

• On the perfect orderability of unions of two graphs
• Bull-free weakly chordal perfectly orderable graphs
• A new class of perfect Hoàng graphs

This page was built for publication: On a conjecture of Hoàng and Tu concerning perfectly orderable graphs

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