Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 19:29, 30 January 2024

scientific article
Language Label Description Also known as
English
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
scientific article

    Statements

    Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (English)
    0 references
    0 references
    0 references
    21 April 2010
    0 references
    graph partition
    0 references
    two-colored complete graph
    0 references
    cycle decomposition
    0 references

    Identifiers