Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers (Q1025522): Difference between revisions
From MaRDI portal
Latest revision as of 17:11, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers |
scientific article |
Statements
Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers (English)
0 references
19 June 2009
0 references
hamiltonicity
0 references
claw-free graph
0 references
quasi-claw-free graph
0 references
polynomial time algorithm
0 references
