Abstract
AbstractFor a number , let denote the family of graphs which have girth and have no odd hole with length greater than . Wu et al. conjectured that every graph in is 3‐colorable. Chudnovsky et al. and Wu et al., respectively, proved that every graph in and is 3‐colorable. In this paper, we prove that every graph in is 3‐colorable.
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.
