scientific article; zbMATH DE number 3603300
From MaRDI portal
Publication:4168628
Cited in
(56)- Acyclic edge coloring of 4-regular graphs without 3-cycles
- Generalized arboricity of graphs with large girth
- Acyclic edge coloring of sparse graphs
- On acyclic edge coloring of toroidal graphs
- Acyclic edge coloring of planar graphs without 4-cycles
- Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
- Acyclic edge coloring of IC-planar graphs
- Acyclic edge coloring of chordal graphs with bounded degree
- Local conditions for planar graphs of acyclic edge coloring
- A new bound on the acyclic edge chromatic number
- Acyclic edge coloring of 4-regular graphs. II.
- The local cut lemma
- Acyclic chromatic index of triangle-free 1-planar graphs
- Acyclic edge coloring of graphs
- 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
- Improved bounds on the generalized acyclic chromatic number
- New bounds for the acyclic chromatic index
- Acyclic edge coloring of 2-degenerate graphs
- Acyclic edge coloring of graphs with maximum degree 4
- 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 planar graphs without 5-cycles
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors
- Acyclic edge colouring of plane graphs
- Acyclic chromatic indices of fully subdivided graphs
- Acyclic edge-coloring of planar graphs: \(\Delta\) colors suffice when \(\Delta\) is large
- Acyclic edge coloring of triangle-free planar graphs
- 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 list edge coloring of graphs with maximum degree 4
- Acyclic edge coloring through the Lovász local lemma
- d‐Regular graphs of acyclic chromatic index at least d+2
- Graph theory (algorithmic, algebraic, and metric problems)
- 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 chromatic index of chordless graphs
- Acyclic edge coloring of 1-planar graphs without 4-cycles
- Edge colorings avoiding patterns
- Upper bounds on the acyclic chromatic index of degenerate graphs
- Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
- Edge colorings avoiding patterns
- Acyclically edge color triangle-free toroidal graphs in + 2 colors
- Semistrong edge colorings of planar graphs
- Strong arboricity of graphs
- Acyclic chromatic index of IC-planar graphs
- On edge colorings of graphs with no color-rich cycles
- Avoiding 2-coloured 4-cycles in edge-coloured subcubic bipartite graphs
- Acyclic edge coloring of 3-sparse graphs
- Computational results on semistrong edge coloring of graphs
- On acyclic edge-coloring of complete bipartite graphs
- Acyclic edge coloring of triangle-free 1-planar graphs
- Further result on acyclic chromatic index of planar graphs
- About acyclic edge colourings of planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168628)