Acyclic chromatic indices of fully subdivided graphs
From MaRDI portal
Publication:436602
DOI10.1016/J.IPL.2012.04.004zbMATH Open1243.05081OpenAlexW2029240401MaRDI QIDQ436602FDOQ436602
Authors: Anna Fiedorowicz, Mariusz Hałuszczak 
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.004
Recommendations
- Acyclic chromatic index of fully subdivided graphs and Halin graphs
- scientific article; zbMATH DE number 3863224
- scientific article; zbMATH DE number 3882456
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
- About acyclic edge colourings of planar graphs
Cites Work
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic edge colorings of graphs
- Acyclic coloring of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acyclic colorings of subcubic graphs
- Acyclic edge coloring of planar graphs with large girth
- Optimal acyclic edge colouring of grid like graphs
- Acyclic edge colorings of planar graphs and series parallel graphs
- Some results on acyclic edge coloring of plane graphs
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic edge-coloring of planar graphs
- Acyclic edge colouring of plane graphs
- Algorithmic aspects of acyclic edge colorings
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
- Title not available (Why is that?)
- Analysis of a heuristic for acyclic edge colouring
Cited In (5)
This page was built for publication: Acyclic chromatic indices of fully subdivided graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436602)
