Acyclic edge coloring of triangle-free 1-planar graphs
From MaRDI portal
Publication:746958
DOI10.1007/s10114-015-4479-yzbMath1323.05055OpenAlexW2264791139MaRDI QIDQ746958
Publication date: 22 October 2015
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-015-4479-y
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Acyclic chromatic index of triangle-free 1-planar graphs ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Acyclic edge coloring of IC-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on acyclic edge coloring of plane graphs
- Acyclic chromatic indices of planar graphs with girth at least five
- Acyclic colorings of subcubic graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- On edge colorings of \(1\)-planar graphs
- Acyclic chromatic index of planar graphs with triangles
- Acyclic chromatic indices of planar graphs with large girth
- Ein Sechsfarbenproblem auf der Kugel
- Acyclic edge coloring of graphs
- Acyclic edge colorings of graphs
- Acyclic edge-colouring of planar graphs. Extended abstract
- Edge Coloring of Triangle-Free 1-Planar Graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic coloring of graphs
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- Acyclic chromatic indices of <italic>K</italic><sub>4</sub>-minor free graphs
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic colouring of 1-planar graphs
This page was built for publication: Acyclic edge coloring of triangle-free 1-planar graphs
