New properties of perfectly orderable graphs and strongly perfect graphs

DOI10.1016/0012-365X(91)90373-AzbMath0752.05050OpenAlexW1973263291MaRDI QIDQ1185094

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

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90373-a

zbMATH Keywords

perfectly orderable graphsstrongly perfect graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

New examples of minimal non-strongly-perfect graphs ⋮ A note on perfectly orderable graphs

Cites Work

• On the complexity of recognizing perfectly orderable graphs
• A class of strongly perfect graphs
• A note on superbrittle graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New properties of perfectly orderable graphs and strongly perfect graphs