Abstract
Circle graphs with girth at least five are known to be 2-degenerate [A.A. Ageev, Every circle graph with girth at least 5 is 3-colourable, Discrete Math. 195 (1999) 229–233]. In this paper, we prove that circle graphs with girth at least g ≥ 5 and minimum degree at least two contain a chain of g − 4 vertices of degree two, which implies Ageev’s result in the case g = 5 . We then use this structural property to give an upper bound on the circular chromatic number of circle graphs with girth at least g ≥ 5 as well as a precise estimate of their maximum average degree.
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.
