Closure and Hamiltonian-connectivity of claw-free graphs (Q1296972)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Closure and Hamiltonian-connectivity of claw-free graphs |
scientific article |
Statements
Closure and Hamiltonian-connectivity of claw-free graphs (English)
0 references
2 November 1999
0 references
The authors define for a graph \(G\), a new closure \(\text{cl}_k(G)\) \((k\geq 1)\) as a generalization of \(\text{cl}(G)\) and prove the following results: (1) A claw-free graph \(G\) is Hamiltonian-connected iff \(\text{cl}_3(G)\) is Hamiltonian-connected. (2) A claw-free graph \(G\) is homogeneously traceable iff \(\text{cl}_2(G)\) is homogeneously traceable. The uniqueness of the closure has also been discussed. Finally, they make the following conjecture: A claw-free graph \(G\) is Hamiltonian-connected iff \(\text{cl}_2(G)\) is Hamiltonian-connected.
0 references
Hamiltonian-connected graph
0 references
closure
0 references
claw-free graph
0 references