Claw-free circular-perfect graphs

DOI10.1016/j.endm.2007.07.071zbMath1341.05094OpenAlexW2055144669MaRDI QIDQ5900081

Xuding Zhu, Arnaud Pêcher

Publication date: 5 June 2008

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

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.071

zbMATH Keywords

claw-free graphcircular-perfect graph

Mathematics Subject Classification ID

Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• On minimally circular-imperfect graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• A strengthening of Ben Rebea's lemma
• Claw-free graphs. VII. Quasi-line graphs
• Minimal circular-imperfect graphs of large clique number and large independence number
• A characterization of perfect graphs
• Some results on circular perfect graphs and perfect graphs
• On strongly circular-perfectness
• Three classes of minimal circular-imperfect graphs
• Star chromatic number
• Circular perfect graphs
• On the circular chromatic number of circular partitionable graphs

This page was built for publication: Claw-free circular-perfect graphs