Abstract
Abstract In that paper we talk about triangle-free simple graphs with given maximum average degree less than 22 / 9. We give an upper bound for the circular chromatic number of such graphs which is at most 11 / 4. We give two other results whose proofs are omitted. We use a discharging method with forbidden configurations. We also omit in this paper the proof that they are indeed forbidden. These proofs rely on a recent paper [A. Raspaud, X. Zhu, List circular coloring of trees and cycles, (2006)] of Raspaud and Zhu and are all straight-forward.
Sign-in/Register to access full text options 
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.
