Algorithmic aspects of acyclic edge colorings
From MaRDI portal
Publication:1348909
DOI10.1007/S00453-001-0093-8zbMATH Open1009.68100OpenAlexW151146055MaRDI QIDQ1348909FDOQ1348909
Publication date: 21 May 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0093-8
Recommendations
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
- Acyclic coloring of graphs of maximum degree \(\Delta \)
- Acyclic edge colourings of graphs with large girth
- Improved upper bounds on acyclic edge colorings
- Acyclic edge coloring of graphs with large girths
Cited In (33)
- Optimal acyclic edge colouring of grid like graphs
- Improved bounds for acyclic chromatic index of planar graphs
- Acyclic Edge Coloring of Triangle‐Free Planar Graphs
- Improved bounds on linear coloring of plane graphs
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
- Hardness transitions and uniqueness of acyclic colouring
- Acyclic 4-edge colouring of non-regular subcubic graphs in linear time
- A survey of graph coloring - its types, methods and applications
- Acyclic chromatic indices of planar graphs with girth at least five
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge colorings of planar graphs and series parallel graphs
- Acyclic chromatic indices of fully subdivided graphs
- Acyclic, star, and injective colouring: bounding the diameter
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
- Acyclic colourings of graphs with bounded degree
- Analysis of a heuristic for acyclic edge colouring
- An algorithm for optimal acyclic edge-colouring of cubic graphs
- Acyclic colorings of subcubic graphs
- Acyclic edge coloring of planar graphs without small cycles
- Efficient algorithms for acyclic colorings of graphs
- The method of coloring in graphs and its application
- Acyclic total colorings of planar graphs without \(l\) cycles
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
- Acyclic chromatic indices of planar graphs with large girth
- Title not available (Why is that?)
- Acyclic chromatic index of planar graphs with triangles
- Acyclic edge coloring of graphs with maximum degree 4
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic edge-coloring using entropy compression
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic edge coloring of 2-degenerate graphs
- Acyclic chromatic index of chordless graphs
This page was built for publication: Algorithmic aspects of acyclic edge colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348909)
