Acyclic edge coloring of 1-planar graphs without 4-cycles
From MaRDI portal
Publication:6137646
DOI10.1007/s10255-024-1101-zzbMath1530.05059OpenAlexW4390521712MaRDI QIDQ6137646
Wei Fan Wang, Yi Qiao Wang, Wanshun Yang
Publication date: 16 January 2024
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-024-1101-z
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Improved bounds on coloring of graphs
- Acyclic edge coloring of planar graphs without 5-cycles
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
- 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
- Acyclic edge coloring of subcubic graphs
- Acyclic edge coloring of planar graphs without 4-cycles
- An improved upper bound for the acyclic chromatic number of 1-planar graphs
- Acyclic chromatic indices of planar graphs with large girth
- On total colorings of 1-planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- Acyclic chromatic index of triangle-free 1-planar graphs
- Acyclic edge-coloring using entropy compression
- Acyclic edge colorings of graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic coloring of graphs
- 1-平面图的结构性质及其在无圈边染色上的应用
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
- Acyclic colouring of 1-planar graphs
This page was built for publication: Acyclic edge coloring of 1-planar graphs without 4-cycles