Monochromatic cycle power partitions (Q2374161): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.disc.2016.08.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2516857358 / rank
 
Normal rank
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: Ramsey-goodness -- and otherwise / 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: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Blow-up Lemma to Arrangeable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup> / 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: The Square of a Hamiltonian Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian square-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic bounded degree subgraph partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977492 / 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: 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: Monochromatic path and cycle partitions in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning complete bipartite graphs by monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic version of the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to avoid using the regularity Lemma: Pósa's conjecture revisited / 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: Partitioning edge-coloured complete graphs into monochromatic cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic cycle partitions of edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved monochromatic loose cycle partitions in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex partitions by connected monochromatic \(k\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:50, 13 July 2024

scientific article
Language Label Description Also known as
English
Monochromatic cycle power partitions
scientific article

    Statements

    Monochromatic cycle power partitions (English)
    0 references
    14 December 2016
    0 references
    monochromatic partitions
    0 references
    powers of cycles
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers