Acyclic edge coloring of graphs with maximum degree 4

From MaRDI portal
Publication:3652530

DOI10.1002/jgt.20376zbMath1221.05127arXiv0801.1744OpenAlexW2949417215MaRDI QIDQ3652530

L. Sunil Chandran, Manu Basavaraju

Publication date: 18 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.1744




Related Items

Local conditions for planar graphs of acyclic edge coloringAcyclic Chromatic Indices of Planar Graphs with Girth At Least 4Acyclic edge coloring of graphs with large girthsSome results on acyclic edge coloring of plane graphsImproved bounds on coloring of graphsOn acyclic edge coloring of toroidal graphsAcyclic chromatic index of planar graphs with trianglesAcyclic edge coloring of planar graphs without 5-cyclesAcyclic edge coloring of planar graphs with \(\varDelta\) colorsAn improved bound on acyclic chromatic index of planar graphsAcyclic edge colouring of plane graphsAcyclic chromatic indices of planar graphs with girth at least fiveAcyclic chromatic indices of fully subdivided graphsAcyclic edge coloring of graphsAcyclic edge coloring of planar graphs without 4-cyclesAcyclic edge coloring of 4-regular graphs without 3-cyclesThe acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycleAcyclic edge coloring of planar graphs without adjacent cyclesAcyclic edge coloring of planar graphs with girth at least 5Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is LargeUnnamed ItemAcyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycleOptimal acyclic edge‐coloring of cubic graphsAcyclic Edge Coloring of Triangle‐Free Planar GraphsAcyclic List Edge Coloring of GraphsAcyclic edge coloring of planar graphs without cycles of specific lengthsAcyclic edge coloring of sparse graphsImproved bounds for acyclic chromatic index of planar graphsAbout acyclic edge colourings of planar graphsAcyclic edge coloring of 4-regular graphs. II.Acyclic edge coloring of IC-planar graphsAcyclic edge coloring conjecture is true on planar graphs without intersecting trianglesAcyclic edge coloring conjecture is true on planar graphs without intersecting trianglesAcyclic edge coloring of triangle-free 1-planar graphsAcyclic edge coloring of chordal graphs with bounded degree



Cites Work