Decomposing complete equipartite graphs into short even cycles (Q3084613): 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: Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path and cycle decompositions of complete equipartite graphs: Four parts / 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 of complete graphs into long cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions of complete multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of complete multipartite graphs into cycles of even length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into short odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartite Oberwolfach problem with uniform tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(C_{p}\)-decompositions of some regular graphs / 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: Q3058999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into cycles of length2p / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into odd square-length cycles: number of parts even / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k / rank
 
Normal rank

Revision as of 21:24, 3 July 2024

scientific article
Language Label Description Also known as
English
Decomposing complete equipartite graphs into short even cycles
scientific article

    Statements

    Decomposing complete equipartite graphs into short even cycles (English)
    0 references
    0 references
    0 references
    25 March 2011
    0 references
    graph decomposition
    0 references
    cycle
    0 references
    complete equipartite graph
    0 references

    Identifiers