Partitioning 3-coloured complete graphs into three monochromatic paths

MaRDI QIDQ2857433zbMATH OpenFDO

Authors Alexey Pokrovskiy

Publication date 1 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065311001867

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partitioning 3-colored complete graphs into three monochromatic cycles
• Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
• Item:QQ324825
• Item:QQ324825

Cites work

• scientific article; zbMATH DE number 15152 (Why is no real title available?)
• A Ramsey-type problem in directed and bipartite graphs
• An improved bound for the monochromatic cycle partition number
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Partitioning 3-colored complete graphs into three monochromatic cycles
• Partitioning 3-coloured complete graphs into three monochromatic paths
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Vertex coverings by monochromatic cycles and trees
• Vertex coverings by monochromatic paths and cycles

Cited in

(8)

• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Partitioning 3-coloured complete graphs into three monochromatic paths
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partitioning 3-colored complete graphs into three monochromatic cycles
• Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs
• One-sided coverings of colored complete bipartite graphs
• Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
• Monochromatic square-cycle and square-path partitions

This page was built for publication: Partitioning 3-coloured complete graphs into three monochromatic paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857433)