Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (Q3958483): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.3190060218 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jgt/Thomason82 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.3190060218 / rank | |||
Normal rank | |||
Latest revision as of 00:23, 22 December 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
