Locally perfect graphs

DOI10.1016/0095-8956(90)90094-GzbMath0649.05057MaRDI QIDQ1105623

Myriam Preissmann

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

perfect graphsvertex colouringbrittle graphslocally perfect colouringlocally perfect graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Perfect graphs with no \(P_ 5\) and no \(K_ 5\) ⋮ Slim graphs ⋮ A note on perfect orders ⋮ Classes of perfect graphs ⋮ On slim graphs, even pairs, and star-cutsets ⋮ On perfectness of sums of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Weakly triangulated graphs
• A note on superbrittle graphs
• Alternating orientation and alternating colouration of perfect graphs
• Murky graphs
• A new property of critical imperfect graphs and some consequences
• Wings and perfect graphs
• All variations on perfectly orderable graphs
• Star-cutsets and perfect graphs
• Complement reducible graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Trivially perfect graphs
• On the perfect graph conjecture
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• On a property of the class of n-colorable graphs
• A decomposition theorem for partially ordered sets
• A note on strong perfectness of graphs
• On brittle graphs
• Four classes of perfectly orderable graphs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs
• Perfect zero–one matrices