On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring

DOI10.1137/1.9781611973761.2zbMath1430.68211OpenAlexW1810595280WikidataQ56390667 ScholiaQ56390667MaRDI QIDQ5194790

Lefteris M. Kirousis, Dimitrios M. Thilikos, Ioannis Giotis, Kostas I. Psaromiligkos

Publication date: 17 September 2019

Published in: 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973761.2

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ Generalized acyclic edge colorings via entropy compression ⋮ Acyclic edge coloring through the Lovász local lemma ⋮ Acyclic edge coloring of 4-regular graphs. II. ⋮ Directed Lovász local lemma and Shearer's lemma

This page was built for publication: On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring