Partitioning 3-coloured complete graphs into three monochromatic paths
From MaRDI portal
Publication:2857433
zbMATH Open1274.05173MaRDI QIDQ2857433FDOQ2857433
Authors: Alexey Pokrovskiy 
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001867
Recommendations
Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- An improved bound for the monochromatic cycle partition number
- Vertex coverings by monochromatic cycles and trees
- A Ramsey-type problem in directed and bipartite graphs
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Title not available (Why is that?)
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Vertex coverings by monochromatic paths and cycles
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Partitioning 3-coloured complete graphs into three monochromatic paths
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)
