Colouring edges with many colours in cycles
type: Item
instance of: scholarly article
title: Colouring edges with many colours in cycles
zbMATH Open document ID: 1301.05131
author: J. Nešetřil
author: Xuding Zhu
author: P. Ossona de Mendez
published in: Journal of Combinatorial Theory. Series B
publication date: 2014-10-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1108.1616
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6359845
zbMATH Keywords: colouring
zbMATH Keywords: arboricity
MaRDI profile type: Publication
OpenAlex ID: W2009437569
arXiv ID: 1108.1616
cites work: Bounds on Edge Colorings with Restrictions on the Union of Color Classes
cites work: On forbidden subdivision characterizations of graph classes
cites work: Graph Theory and Probability
cites work: An algorithm for fraternal orientation of graphs
cites work: A bound on the chromatic number using the longest odd cycle length
cites work: Bounds of the number of disjoint spanning trees
cites work: Q5294699
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: The Grad of a Graph and Classes with Bounded Expansion
cites work: Linear time low tree-width partitions and algorithmic consequences
cites work: Tree-depth, subgraph coloring and homomorphism bounds
cites work: Grad and classes with bounded expansion. I: Decompositions
cites work: Q3567810
cites work: Sparsity. Graphs, structures, and algorithms
cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
cites work: Colouring graphs with bounded generalized colouring number
DOI: 10.1016/J.JCTB.2014.06.002
description: scientific article; zbMATH DE number 6359845