@book{4d5275e812fb4d7ebbaea164a3f23c51,

title = "Chordality and 2-factors in tough graphs",

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 ..-tough 5-chordal graphs have a 2-factor. This result is best possible in two ways. Examples due to Chv{\'a}tal show that for all ε>0 there exists a (..-ε)-tough chordal graph with no 2-factor. Furthermore, examples due to Bauer and Schmeichel show that the result is false for 6-chordal graphs.",

keywords = "Toughness, IR-74368, METIS-141260, 2-factors, Chordal graphs",

author = "D. Bauer and G.Y. Katona and D. Kratsch and H.J. Veldman",

note = "Memorandum Faculteit TW, nr 1430 ",

year = "1998",

doi = "10.1016/S0166-218X(99)00142-0",

language = "Undefined",

isbn = "0169-2690",

publisher = "Universiteit Twente",

number = "1-3",

}