Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths

DOI10.1007/s11856-020-2030-zzbMath1447.05168arXiv1808.09836OpenAlexW3033580797MaRDI QIDQ2200044

Carl Bürger, Max F. Pitz

Publication date: 15 September 2020

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.09836

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 (1)

Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles

Cites Work

• Unnamed Item
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Graph Theory
• Monochromatic Paths in Graphs

This page was built for publication: Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths