On Decomposing the Complete Graph into the Union of Two Disjoint Cycles (Q2946050): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1009023
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Saad I. El-Zanati / rank
 
Normal rank
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.1007/978-3-319-19315-1_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1011940379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graceful valuations of 2-regular graphs with two components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the existence of<i>G</i>-Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798525 / 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: Q4458217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cyclic decomposition of complete graphs into almost-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cyclic Decompositions of Complete Graphs into Tripartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong difference families over arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of odd cycle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2876056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3526001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nesting of cycle systems of odd length / 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: A complete solution to the two-table Oberwolfach problems / rank
 
Normal rank

Latest revision as of 18:15, 10 July 2024

scientific article
Language Label Description Also known as
English
On Decomposing the Complete Graph into the Union of Two Disjoint Cycles
scientific article

    Statements

    On Decomposing the Complete Graph into the Union of Two Disjoint Cycles (English)
    0 references
    0 references
    0 references
    0 references
    15 September 2015
    0 references
    graph decomposition
    0 references
    Bose construction
    0 references
    disjoint cycles
    0 references

    Identifiers