Chordality and 2-factors in Tough Graphs

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

• Type: Journal
• Year: 2000
• Where: DAM
• Authors: Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
• Keywords: Chordal, Chordless Cycle, DAM 2000, Longest Chordless Cycle