Induced nets and Hamiltonicity of claw-free graphs (Q2045363): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1803.09416 / rank | |||
Normal rank |
Revision as of 00:22, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Induced nets and Hamiltonicity of claw-free graphs |
scientific article |
Statements
Induced nets and Hamiltonicity of claw-free graphs (English)
0 references
12 August 2021
0 references
The connected graph of the degree sequence 3, 3, 3, 1, 1, 1 is called a net, and the vertices of degree 1 in a net are called its endvertices. The authors prove that a 2-connected graph \(G\) of \(n\) vertices with no induced \(K_{1,3}\) is Hamiltonian if every endvertex of each induced net of \(G\) has degree at least \(( n - 2) / 3\).
0 references
Hamiltonian cycles
0 references
claw-free graphs
0 references