On the cyclic decomposition of complete graphs into almost-bipartite graphs (Q1876676): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: All 2-regular graphs consisting of 4-cycles are graceful / 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: 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: Skolem-type difference sets for cycle systems / 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: Q2760443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclically decomposing the complete graph into cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5345646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876946 / 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: Q5589124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions III: Complete graphs and fixed length cycles / rank
 
Normal rank

Latest revision as of 19:25, 6 June 2024

scientific article
Language Label Description Also known as
English
On the cyclic decomposition of complete graphs into almost-bipartite graphs
scientific article

    Statements

    On the cyclic decomposition of complete graphs into almost-bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2004
    0 references
    Cyclic decomposition
    0 references
    Almost-bipartite
    0 references
    Graph labeling
    0 references

    Identifiers