Cyclically decomposing the complete graph into cycles (Q1827757): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cycle decompositions of \(K_n\) and \(K_n-I\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of cyclic \(k\)-cycle systems of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5345646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of a Conjecture of Th. Skolem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cyclic decompositions of the complete graph into polygons with odd number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions III: Complete graphs and fixed length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of near-Skolem and hooked near-Skolem sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain distributions of integers in pairs with given differences / rank
 
Normal rank

Revision as of 18:26, 6 June 2024

scientific article
Language Label Description Also known as
English
Cyclically decomposing the complete graph into cycles
scientific article

    Statements

    Cyclically decomposing the complete graph into cycles (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Complete graph
    0 references
    Cycle system
    0 references
    Skolem sequence
    0 references
    Hooked Skolem sequence
    0 references
    Near Skolem sequence
    0 references

    Identifiers