Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (Q2800590): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 2-edge-colored graphs by monochromatic paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic Cycles in 2-Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic cycle partitions of graphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic cycles and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for <i>k</i>‐ordered hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for the monochromatic cycle partition number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tripartite Ramsey numbers for paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-color Ramsey numbers for paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 3-colored complete graphs into three monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type theorem on equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type versions of Brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2857433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning edge-coloured complete graphs into monochromatic cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Revision as of 19:06, 11 July 2024

scientific article
Language Label Description Also known as
English
Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
scientific article

    Statements

    Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (English)
    0 references
    0 references
    0 references
    15 April 2016
    0 references
    monochromatic partition
    0 references
    Ore-type graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references