Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038): 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.1002/jgt.20578 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152540681 / rank | |||
Normal rank | |||
Revision as of 20:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs |
scientific article |
Statements
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (English)
0 references
13 June 2012
0 references
line graph
0 references
4-connected
0 references
Hamiltonian
0 references
Hamilton-connected
0 references
dominating cycle
0 references
Thomassen's conjecture
0 references
snark
0 references
