Meyniel weakly triangulated graphs. I: Co-perfect orderability

DOI10.1016/S0166-218X(96)00008-XzbMath0878.05035OpenAlexW2043418908MaRDI QIDQ678852

Ryan B. Hayward

Publication date: 18 December 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

greedy algorithmchromatic numberweakly triangulated graphconjecture of Chvátalpefectly orderableperfect order

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Weighted independent sets in classes of \(P_6\)-free graphs ⋮ On a conjecture of Hoàng and Tu concerning perfectly orderable graphs ⋮ Perfectly contractile graphs and quadratic toric rings ⋮ A new characterization of HH-free graphs ⋮ Finding houses and holes in graphs ⋮ An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs ⋮ Coloring Artemis graphs

Cites Work

• Weakly triangulated graphs
• On the complexity of recognizing perfectly orderable graphs
• A charming class of perfectly orderable graphs
• On the perfect graph conjecture
• On the complexity of recognizing a class of perfectly orderable graphs
• Characterizations of totally balanced matrices
• Which line-graphs are perfectly orderable?
• On brittle graphs

This page was built for publication: Meyniel weakly triangulated graphs. I: Co-perfect orderability