Hamilton connectedness and the partially square graphs (Q2497487): Difference between revisions
From MaRDI portal
Latest revision as of 18:32, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hamilton connectedness and the partially square graphs |
scientific article |
Statements
Hamilton connectedness and the partially square graphs (English)
0 references
4 August 2006
0 references
Let \(G\) be a \(k\)-connected graph. The authors use the notions of a partially sqauare graph \(G^*\) of \(G\) and a quasi-claw-free graph. They prove that a \(k\)-connected graph \(G\) \((k\geq 3)\) is either Hamiltonian-connected or the independence number of \(G^*\) is at least \(k\). The authors also give a positive answer to two open problems from the literature.
0 references
Hamiltonicity
0 references
degree sum
0 references
independent sets
0 references
neighborhood unions and intersections
0 references
quasi-claw-free graphs
0 references