Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (Q3958483): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56621590, #quickstatements; #temporary_batch_1711439739529 |
Created claim: DBLP publication ID (P1635): journals/jgt/Thomason82, #quickstatements; #temporary_batch_1731505720702 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Uniquely Line Colorable Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jgt/Thomason82 / rank | |||
Normal rank | |||
Latest revision as of 15:25, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable |
scientific article |
Statements
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (English)
0 references
1982
0 references
edge coloring
0 references
generalized Petersen graph
0 references
