scientific article; zbMATH DE number 3603300
From MaRDI portal
Publication:4168628
zbMath0388.05015MaRDI QIDQ4168628
Publication date: 1978
Full work available at URL: https://eudml.org/doc/34025
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (46)
Improved bounds on the generalized acyclic chromatic number ⋮ New bounds for the acyclic chromatic index ⋮ Local conditions for planar graphs of acyclic edge coloring ⋮ Acyclic chromatic index of triangle-free 1-planar graphs ⋮ Acyclic chromatic index of chordless graphs ⋮ 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 ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ A new bound on the acyclic edge chromatic number ⋮ On acyclic edge coloring of toroidal graphs ⋮ Acyclic edge coloring of planar graphs without 5-cycles ⋮ Edge colorings avoiding patterns ⋮ Acyclic edge coloring of planar graphs with \(\varDelta\) colors ⋮ Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ Acyclic edge colouring of plane graphs ⋮ Further result on acyclic chromatic index of planar graphs ⋮ 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 ⋮ The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle ⋮ Acyclic edge-coloring using entropy compression ⋮ Acyclic edge coloring of planar graphs without adjacent 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 ⋮ On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) ⋮ Acyclic edge coloring through the Lovász local lemma ⋮ Acyclic Edge Coloring of Triangle‐Free Planar Graphs ⋮ Acyclic edge coloring of sparse graphs ⋮ About acyclic edge colourings of planar graphs ⋮ Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles ⋮ 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 ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ 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 ⋮ Acyclic edge coloring of triangle-free 1-planar graphs ⋮ Acyclic edge coloring of chordal graphs with bounded degree ⋮ Acyclic edge coloring of graphs with maximum degree 4 ⋮ Acyclic edge coloring of 2-degenerate graphs ⋮ The local cut lemma
This page was built for publication: