Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs

DOI10.1016/j.disc.2018.07.025zbMath1395.05067arXiv1805.01699OpenAlexW2963917045WikidataQ129345154 ScholiaQ129345154MaRDI QIDQ1783629

Carl Bürger, Hannah Guggiari, Louis DeBiasio, Max F. Pitz

Publication date: 21 September 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

monochromatic path partitioncomplete symmetric digraphedge-colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Density of monochromatic infinite paths

Cites Work

• Unnamed Item
• Unnamed Item
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• Monochromatic infinite paths
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Sur le circuit hamiltonien bi-colore dans les graphes orientes
• Monochromatic Paths in Graphs
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I

This page was built for publication: Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs