Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
From MaRDI portal
Publication:1944091
DOI10.1016/J.IPL.2010.12.002zbMATH Open1259.05058OpenAlexW2000814123MaRDI QIDQ1944091FDOQ1944091
Authors: Anna Fiedorowicz 
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.12.002
Recommendations
Cites Work
- Title not available (Why is that?)
- Acyclic coloring of graphs
- Title not available (Why is that?)
- Acyclic colorings of subcubic graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Algorithmic aspects of acyclic edge colorings
- Analysis of a heuristic for acyclic edge colouring
Cited In (9)
- Generalised acyclic edge colourings of graphs with large girth
- Acyclic chromatic indices of fully subdivided graphs
- Analysis of a heuristic for acyclic edge colouring
- An algorithm for optimal acyclic edge-colouring of cubic graphs
- Algorithmic aspects of acyclic edge colorings
- Upper bounds on the acyclic chromatic index of degenerate graphs
- Title not available (Why is that?)
- Acyclic colouring of some line graphs
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
This page was built for publication: Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944091)
