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
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it...
AbstractA 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said t...
AbstractA 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said t...
AbstractA graph G is chordal if it contains no chordless cycle of length at least four and is k-chor...
AgraphG is chordal if it contains no chordless cycle of length at least four and is k-chordal if a l...
AbstractA graph G is chordal if it contains no chordless cycle of length at least four and is k-chor...
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
We present (9/4-ε)-tough graphs without a Hamilton path for arbitrary >0, thereby refuting a well-kn...
We present (9/4-ε)-tough graphs without a Hamilton path for arbitrary >0, thereby refuting a well-kn...
AbstractA graph G is called chordal if every cycle of G of length at least four has a chord. By a th...
AbstractWe present (94−ε)-tough graphs without a Hamilton path for arbitrary ε>0, thereby refuting a...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it...
AbstractA 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said t...
AbstractA 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said t...
AbstractA graph G is chordal if it contains no chordless cycle of length at least four and is k-chor...
AgraphG is chordal if it contains no chordless cycle of length at least four and is k-chordal if a l...
AbstractA graph G is chordal if it contains no chordless cycle of length at least four and is k-chor...
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
We present (9/4-ε)-tough graphs without a Hamilton path for arbitrary >0, thereby refuting a well-kn...
We present (9/4-ε)-tough graphs without a Hamilton path for arbitrary >0, thereby refuting a well-kn...
AbstractA graph G is called chordal if every cycle of G of length at least four has a chord. By a th...
AbstractWe present (94−ε)-tough graphs without a Hamilton path for arbitrary ε>0, thereby refuting a...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it...
AbstractA 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said t...
AbstractA 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said t...
DOI
Add to ORKG