Decomposing edge-colored graphs under color degree constraints

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

Ruonan Li, Shinya Fujita, Guang-Hui Wang

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

digraphsvertex partitionedge-colored graphBermond-Thomassen conjectureminimum colour degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Decomposing edge-colored graphs under color degree constraints ⋮ A classification of edge-colored graphs based on properly colored walks ⋮ A note on partitions of graphs under degree constraints ⋮ A generalization of Stiebitz-type results on graph decomposition ⋮ Properly colored short cycles in edge-colored graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint cycles in digraphs
• Disjoint directed cycles
• Alternating cycles in edge-partitioned graphs
• A note on alternating cycles in edge-coloured graphs
• An improved bound for disjoint directed cycles
• Decomposing edge-colored graphs under color degree constraints
• Splitting digraphs
• Cycles in digraphs– a survey
• Nonseparating cycles inK-Connected graphs
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
• A Relaxed Version of the Erdős–Lovász Tihany Conjecture
• Transitiv orientierbare Graphen

This page was built for publication: Decomposing edge-colored graphs under color degree constraints