Hamiltonicity in claw-free graphs
Journal of Combinatorial Theory Series A
On hamiltonian claw-free graphs
Discrete Mathematics
Hamiltonian cycles in 3-connected claw-free graphs
Journal of Graph Theory
A linear time algorithm to compute a dominating path in an AT-free graph
Information Processing Letters
Every 3-connected, locally connected, claw-free graph is Hamilton-connected
Journal of Graph Theory
Selected papers from the second Krakow conference on Graph theory
On a closure concept in claw-free graphs
Journal of Combinatorial Theory Series B
SIAM Journal on Discrete Mathematics
Characterizing forbidden pairs for hamiltonian properties
Discrete Mathematics
Closure and Hamiltonian-connectivity of claw-free graphs
Discrete Mathematics
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
Discrete Mathematics
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
On Claw-Free Asteroidal Triple-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We prove that claw-free graphs, containing an induced dominating path, have a Hamiltonian path, and that two-connected claw-free graphs, containing an induced doubly dominating cycle or a pair of vertices such that there exist two internally disjoint induced dominating paths connecting them, have a Hamiltonian cycle. As a consequence, we obtain linear time algorithms for both problems if the input is restricted to (claw,net)-free graphs. These graphs enjoy those interesting structural properties.