On generalized perfect graphs: Bounded degree and bounded edge perfection

DOI10.1016/0166-218X(93)90234-FzbMath0790.05028MaRDI QIDQ686267

Edward R. Scheinerman, Ann N. Trenk

Publication date: 22 June 1994

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

zbMATH Keywords

chromatic numbercliqueperfect graph conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Generalized perfect graphs: Characterizations and inversion ⋮ The complexity of generalized graph colorings

Cites Work

• Topics on perfect graphs
• Generalized perfect graphs: Characterizations and inversion
• The point-arboricity of a graph
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• On generalized graph colorings
• A Note on the Vertex Arboricity of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On generalized perfect graphs: Bounded degree and bounded edge perfection