Generalized arboricity of graphs with large girth
type: Item
instance of: scholarly article
title: Generalized arboricity of graphs with large girth
zbMATH Open document ID: 1407.05085
author: Tomasz Bartnicki
author: Bartłomiej Bosek
author: Sebastian Czerwiński
author: Michał Farnik
author: Jarosław Grytczuk
author: Zofia Miechowicz
published in: Discrete Mathematics
publication date: 2019-03-25T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7041391
zbMATH Keywords: arboricity
zbMATH Keywords: acyclic chromatic index
zbMATH Keywords: bounded expansion
zbMATH Keywords: entropy compression
MaRDI profile type: Publication
full work available at URL: j.disc.2019.01.018
OpenAlex ID: W2911399964
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Acyclic edge colorings of graphs
cites work: Nonrepetitive colouring via entropy compression
cites work: Acyclic edge-coloring using entropy compression
cites work: Q4168628
cites work: Generalised acyclic edge colourings of graphs with large girth
cites work: Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
cites work: New approach to nonrepetitive sequences
cites work: Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution
cites work: Q5560917
cites work: An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs
cites work: Decomposing a graph into forests
cites work: A constructive proof of the general lovász local lemma
cites work: Structural sparsity
cites work: Colouring edges with many colours in cycles
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: Q3808121
cites work: On the perfect one-factorization conjecture
cites work: Decomposing a planar graph with girth at least 8 into a forest and a matching
Wikidata QID: Q128492752
DOI: 10.1016/J.DISC.2019.01.018
description: scientific article; zbMATH DE number 7041391