Acyclic chromatic index of triangle-free 1-planar graphs
From MaRDI portal
Publication:2409523
DOI10.1007/s00373-017-1809-0zbMath1407.05089arXiv1504.06234OpenAlexW1733886455MaRDI QIDQ2409523
Huiqin Zhang, Jijuan Chen, Tao Wang
Publication date: 11 October 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06234
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (2)
Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Acyclic edge coloring of IC-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Improved bounds on coloring of graphs
- Acyclic edge coloring through the Lovász local lemma
- A new upper bound on the acyclic chromatic indices of planar 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
- Acyclic edge colorings of planar graphs and series parallel graphs
- Acyclic chromatic index of planar graphs with triangles
- An improved bound on acyclic chromatic index of planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- Acyclic edge coloring of graphs
- Acyclic edge-coloring using entropy compression
- Acyclic edge colorings of graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic coloring of graphs
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
This page was built for publication: Acyclic chromatic index of triangle-free 1-planar graphs