Meyniel weakly triangulated graphs. I: Co-perfect orderability

DOI10.1016/S0166-218X(96)00008-XMaRDI QIDQ678852zbMATH OpenOpenAlexFDO

Authors Ryan 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 number[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=conjecture+of+Chv%EF%BF%BD%EF%BF%BDtal&go=Go conjecture of Chv��tal]pefectly orderableperfect orderweakly triangulated graph

Mathematics Subject Classification ID

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

Recommendations

• A charming class of perfectly orderable graphs
• Four classes of perfectly orderable graphs
• On a conjecture of Hoàng and Tu concerning perfectly orderable graphs
• Weakly triangulated graphs

Cites work

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

Cited in

(9)

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

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

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