Maximum packings of the complete graph with uniform length cycles (Q3174232): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.20536 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077942532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions of \(K_n\) and \(K_n-I\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Alspach Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of complete graphs into long cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic solution to the cycle decomposition problem for complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions into 2-regular subgraphs and equitable partial cycle decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions of complete multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum packings with odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing pentagons into complete graphs: How clumsy can you get? / 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: Q5522938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and Covering of the Complete Graph with 4-Cycles<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs. / rank
 
Normal rank

Latest revision as of 13:24, 4 July 2024

scientific article
Language Label Description Also known as
English
Maximum packings of the complete graph with uniform length cycles
scientific article

    Statements

    Maximum packings of the complete graph with uniform length cycles (English)
    0 references
    0 references
    0 references
    12 October 2011
    0 references
    0 references
    maximum packings
    0 references
    cycles
    0 references
    0 references