Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (Q3958483): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/jgt/Thomason82, #quickstatements; #temporary_batch_1731505720702
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.3190060218 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142184171 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56621590 / rank
 
Normal rank
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
    0 references

    Identifiers