Acyclic edge colorings of graphs
From MaRDI portal
Publication:2746208
DOI10.1002/jgt.1010zbMath0996.05050OpenAlexW4248906376WikidataQ56390605 ScholiaQ56390605MaRDI QIDQ2746208
Ayal Zaks, Noga Alon, Benjamin Sudakov
Publication date: 6 November 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.1010
Related Items (81)
Improved bounds on the generalized acyclic chromatic number ⋮ Acyclic colorings of subcubic graphs ⋮ New bounds for the acyclic chromatic index ⋮ Local conditions for planar graphs of acyclic edge coloring ⋮ Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 ⋮ Generalised acyclic edge colourings of graphs with large girth ⋮ Acyclic chromatic index of triangle-free 1-planar graphs ⋮ Acyclic edge coloring of planar graphs without small cycles ⋮ Acyclic chromatic index of chordless graphs ⋮ Acyclic edge coloring of graphs with large girths ⋮ Improved upper bounds on acyclic edge colorings ⋮ Some results on acyclic edge coloring of plane graphs ⋮ On acyclic edge coloring of planar graphs without intersecting triangles ⋮ Improved bounds on coloring of graphs ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Acyclic vertex coloring of graphs of maximum degree 5 ⋮ A new bound on the acyclic edge chromatic number ⋮ On acyclic edge coloring of toroidal graphs ⋮ Acyclic chromatic index of planar graphs with triangles ⋮ Acyclic edge coloring of planar graphs without 5-cycles ⋮ Edge colorings avoiding patterns ⋮ Acyclic edge coloring of planar graphs with \(\varDelta\) colors ⋮ The method of coloring in graphs and its application ⋮ Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ Acyclic edge colouring of plane graphs ⋮ Further result on acyclic chromatic index of planar graphs ⋮ Acyclic chromatic indices of planar graphs with girth at least five ⋮ Acyclic chromatic indices of fully subdivided graphs ⋮ Acyclic edge coloring of graphs ⋮ Acyclic edge coloring of planar graphs without 4-cycles ⋮ Acyclic edge coloring of 4-regular graphs without 3-cycles ⋮ A survey of graph coloring - its types, methods and applications ⋮ On the adjacent vertex-distinguishing acyclic edge coloring of some graphs ⋮ The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle ⋮ Acyclic edge-coloring using entropy compression ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Acyclic edge coloring of planar graphs without adjacent cycles ⋮ Acyclic edge coloring of planar graphs with girth at least 5 ⋮ The cook-book approach to the differential equation method ⋮ Acyclic total colorings of planar graphs without \(l\) cycles ⋮ Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large ⋮ Generalized arboricity of graphs with large girth ⋮ Unnamed Item ⋮ Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle ⋮ Improved bounds on acyclic edge colouring ⋮ An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs ⋮ On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) ⋮ Generalized acyclic edge colorings via entropy compression ⋮ Acyclic edge coloring through the Lovász local lemma ⋮ Optimal acyclic edge‐coloring of cubic graphs ⋮ Acyclic Edge Coloring of Triangle‐Free Planar Graphs ⋮ Acyclic List Edge Coloring of Graphs ⋮ Star Chromatic Index ⋮ Acyclic edge coloring of planar graphs without cycles of specific lengths ⋮ Acyclic edge coloring of sparse graphs ⋮ Improved bounds for acyclic chromatic index of planar graphs ⋮ Acyclic edge colouring of planar graphs without short cycles ⋮ Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles ⋮ Optimal acyclic edge colouring of grid like graphs ⋮ Acyclic edge coloring of 4-regular graphs. II. ⋮ d‐Regular graphs of acyclic chromatic index at least d+2 ⋮ Acyclic edge coloring of IC-planar graphs ⋮ Acyclic chromatic indices of planar graphs with large girth ⋮ Acyclic edge chromatic number of outerplanar graphs ⋮ On acyclic edge-coloring of complete bipartite graphs ⋮ Acyclic edge coloring of subcubic 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 ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Acyclic edge coloring of triangle-free 1-planar graphs ⋮ Acyclic edge coloring of chordal graphs with bounded degree ⋮ Acyclic edge colourings of graphs with large girth ⋮ Acyclic edge coloring of planar graphs with large girth ⋮ Acyclic edge coloring of graphs with maximum degree 4 ⋮ An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph ⋮ Acyclic edge coloring of 2-degenerate graphs ⋮ Acyclic edge colorings of planar graphs and series parallel graphs ⋮ A note on acyclic edge coloring of complete bipartite graphs ⋮ Acyclic edge-colouring of planar graphs. Extended abstract ⋮ The local cut lemma
Cites Work
This page was built for publication: Acyclic edge colorings of graphs
