Optimal acyclic edge‐coloring of cubic graphs
From MaRDI portal
Publication:4650186
DOI10.1002/jgt.20650zbMath1292.05105OpenAlexW2122887165MaRDI QIDQ4650186
Lars Døvling Andersen, Ján Mazák, Edita Máčajová
Publication date: 23 November 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20650
Related Items
Acyclic chromatic index of chordless graphs ⋮ Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ Acyclic edge coloring of graphs ⋮ Acyclic edge coloring of 4-regular graphs without 3-cycles ⋮ Acyclic edge coloring of planar graphs with girth at least 5 ⋮ Acyclic 4-edge colouring of non-regular subcubic graphs in linear time ⋮ Acyclic edge coloring of 4-regular graphs. II. ⋮ On acyclic edge-coloring of complete bipartite graphs ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
Cites Work
