Abstract
Abstract The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. A consequence of the strong perfect graph theorem is that minimal circular-imperfect graphs G have min { α ( G ) , ω ( G ) } = 2 . In contrast to this result, it is shown in [Z. Pan and X. Zhu. Minimal circular-imperfect graphs of large clique number and large independence number. manuscript, 2006] that minimal circular-imperfect graphs G can have arbitrarily large independence number and arbitrarily large clique number. We prove that claw-free minimal circular-imperfect graphs G have min { α ( G ) , ω ( G ) } ⩽ 3 .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
