Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (Q3958483): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56621590, #quickstatements; #temporary_batch_1711439739529 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56621590 / rank | |||
Normal rank | |||
Revision as of 18:57, 26 March 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
