Decomposing edge-colored graphs under color degree constraints

DOI10.1016/j.endm.2017.06.078zbMath1378.05058arXiv1701.03007MaRDI QIDQ1689962

Guang-Hui Wang, Shinya Fujita, Ruonan Li

Publication date: 18 January 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

digraphs; vertex partition; edge-colored graph; Bermond-Thomassen conjecture; minimum colour degree

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments