Abstract
A graph G is chordal if it contains no chordless cycle of length at least four and is k- chordal if a longest chordless cycle in G has length at most k. In this note it is proved that all 3 2 -tough 5-chordal graphs have a 2-factor. This result is best possible in two ways. Examples due to Chvátal show that for all ε>0 there exists a ( 3 2 −ε) -tough chordal graph with no 2-factor. Furthermore, examples due to Bauer and Schmeichel show that the result is false for 6-chordal graphs.
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.
