Colouring edges with many colours in cycles

DOI10.1016/j.jctb.2014.06.002zbMath1301.05131arXiv1108.1616OpenAlexW2009437569MaRDI QIDQ462927

Jaroslav Nešetřil, Xuding Zhu, Patrice Ossona de Mendez

Publication date: 22 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

colouringarboricity

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ Generalized arboricity of graphs with large girth

Cites Work

• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• On forbidden subdivision characterizations of graph classes
• Colouring graphs with bounded generalized colouring number
• An algorithm for fraternal orientation of graphs
• Bounds of the number of disjoint spanning trees
• Grad and classes with bounded expansion. I: Decompositions
• Tree-depth, subgraph coloring and homomorphism bounds
• Linear time low tree-width partitions and algorithmic consequences
• Bounds on Edge Colorings with Restrictions on the Union of Color Classes
• Graph Theory and Probability
• Edge-Disjoint Spanning Trees of Finite Graphs
• A bound on the chromatic number using the longest odd cycle length
• The Grad of a Graph and Classes with Bounded Expansion
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Colouring edges with many colours in cycles