scientific article

zbMath1274.05173MaRDI QIDQ2857433

Alexey Pokrovskiy

Publication date: 1 November 2013

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (3)

Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ Unnamed Item ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning 3-colored complete graphs into three monochromatic cycles
• An improved bound for the monochromatic cycle partition number
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• 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
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Vertex coverings by monochromatic paths and cycles

This page was built for publication: