A note on acyclic vertex-colorings
From MaRDI portal
Publication:344457
DOI10.4310/JOC.2016.v7.n4.a8zbMath1350.05040arXiv1312.5600MaRDI QIDQ344457
Jean-Sébastien Sereni, Jan Volec
Publication date: 22 November 2016
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.5600
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (6)
Hardness transitions and uniqueness of acyclic colouring ⋮ Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large ⋮ Generalized acyclic edge colorings via entropy compression ⋮ Entropy compression versus Lovász local lemma ⋮ Acyclic coloring of graphs and entropy compression method
This page was built for publication: A note on acyclic vertex-colorings
