Sciweavers

131 search results - page 3 / 27
» 2-Factors in Hamiltonian Graphs
Sort
View
DAM
2011
13 years 1 months ago
Hamiltonian index is NP-complete
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
Zdenek Ryjácek, Gerhard J. Woeginger, Limin...
DAM
2000
121views more  DAM 2000»
13 years 7 months ago
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 t...
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, He...
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
13 years 7 months ago
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
Brett Stevens
DM
2010
118views more  DM 2010»
13 years 7 months ago
Closure concept for 2-factors in claw-free graphs
Zdenek Ryjácek, Liming Xiong, Kiyoshi Yoshi...
JDA
2010
77views more  JDA 2010»
13 years 5 months ago
Computing sharp 2-factors in claw-free graphs
Hajo Broersma, Daniël Paulusma