Abstract
AbstractLet be a graph with , and let be obtained from by gluing in vertex‐disjoint copies of . We prove that if contains at most one odd cycle of length exceeding 3, or if contains at most three triangles, then . This proves the Strong Coloring Conjecture for such graphs . For graphs with that are not covered by our theorem, we prove an approximation result towards the conjecture.
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.
