Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123002454, #quickstatements; #temporary_batch_1707161894653 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:57, 5 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
