# Chordality and 2-factors in tough graphs

Bauer, D.
and
Katona, G.Y.
and
Kratsch, D.
and
Veldman, H.J.
(2000)
*Chordality and 2-factors in tough graphs.*
Discrete Mathematics, 99
(1-3).
pp. 323-329.
ISSN 0012-365X

PDF
Restricted to UT campus only : Request a copy 70kB |

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á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. |

Item Type: | Article |

Copyright: | © 2000 Elsevier |

Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |

Research Group: | |

Link to this item: | http://purl.utwente.nl/publications/74368 |

Official URL: | http://dx.doi.org/10.1016/S0166-218X(99)00142-0 |

Export this item as: | BibTeX EndNote HTML Citation Reference Manager |

Repository Staff Only: item control page

Metis ID: 141260