Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs (Q1348122): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(01)00141-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1536638005 / rank | |||
Normal rank | |||
Latest revision as of 11:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs |
scientific article |
Statements
Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs (English)
0 references
15 May 2002
0 references
A graph containing no induced subgraph isomorphic to \(K_{1,3}\) is said to be claw-free. This paper has been inspired by a result of \textit{M.~Li} [J. Graph Theory 17, 303-313 (1993; Zbl 0778.05056)] saying that any 3-connected claw-free graph of order \(n\) and minimum degree at least \((n+5)/5\) is Hamiltonian. The authors prove that the theorem holds even if the claw-free condition is replaced by the weaker assumption that \(G\) does not contain any induced subgraph isomorphic to \(K_{1,4}\) or \(K_{1,4}+e\), provided \(n\geq 30\).
0 references
Hamiltonicity
0 references
\(\{K_{1,4}, K_{1,4}+e\}\)-free graph
0 references
