Abstract
AbstractA pentagraph is a graph without cycles of length 3 or 4 and without induced cycles of odd length at least 7, and a heptagraph is one without cycles of length less than 7 and without induced cycles of odd length at least 9. Chudnovsky and Seymour proved that every pentagraph is 3‐colorable. In this paper, we show that every heptagraph is 3‐colorable.
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.
