@article{e3e8c01b6d6b4866832f43806fbf747e,
title = "Decomposing edge-coloured graphs under colour degree constraints",
abstract = "For an edge-coloured graph G, the minimum colour degree of G means the minimum number of colours on edges which are incident to each vertex of G. We prove that if G is an edge-coloured graph with minimum colour degree at least 5, then V(G) can be partitioned into two parts such that each part induces a subgraph with minimum colour degree at least 2. We show this theorem by proving amuch stronger form. Moreover, we point out an important relationship between our theorem and Bermond and Thomassen's conjecture in digraphs.",
keywords = "n/a OA procedure",
author = "Shinya Fujita and Ruonan Li and Guanghui Wang",
note = "Funding Information: †In this work, an extended abstract for the EUROCOMB 2017 (European Conference on Combinatorics, Graph Theory and Applications, 2017) conference proceedings has been published in [6]. ‡Supported by JSPS KAKENHI (no. 15K04979). §Supported by the Fundamental Research Funds for the Central Universities (no. 31020180QD124) and NSFC (no. 11671320, 11671429). ¶Supported by NSFC (no. 11871193, 11631014). Publisher Copyright: {\textcopyright} 2019 Cambridge University Press.",
year = "2019",
month = sep,
day = "1",
doi = "10.1017/S0963548319000014",
language = "English",
volume = "28",
pages = "755--767",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "5",
}