Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number (Q6513060)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number |
scientific article from arXiv |
Statements
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number (English)
0 references
