A graph G is chordal if it contains no chlordless cycle of length at least four211u001eand is k-chordal if a longest chordless cycle in G has length at most k. In this 211u001enote it is proved that all 3/2-tough 5-chordal graphs have a 2-factor. This 211u001eresult is best possible in two ways. Examples due to Chvatal show that for all 211u001eepsilon > 0 there exists a (3/2-epsilon)-tough chordal graph with no 2-factor. 211u001eFurthermore, examples due to Bauer and Scheichel show that the result is false 211u001efor 6-chordal graphs.
展开▼
