On minimally circular-imperfect graphs

DOI10.1016/j.disc.2007.06.014zbMath1157.05026OpenAlexW1971513429MaRDI QIDQ932581

Bao-Gang Xu

Publication date: 11 July 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.014

zbMATH Keywords

circular coloringcircular cliquecircular-perfect

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Claw‐free circular‐perfect graphs ⋮ On circular-perfect graphs: a survey ⋮ Claw-free circular-perfect graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Some results on circular perfect graphs and perfect graphs
• Graphs whose circular clique number equals the clique number
• Minimally circular-imperfect graphs with a major vertex
• Convex-round graphs are circular-perfect
• A note on the star chromatic number
• Star chromatic number
• Circular perfect graphs
• Circular chromatic number and Mycielski graphs
• Circular chromatic number: A survey

This page was built for publication: On minimally circular-imperfect graphs