Acyclic edge coloring of 1-planar graphs without 4-cycles
From MaRDI portal
Publication:6137646
Recommendations
- Acyclic edge coloring of planar graphs without 4-cycles
- Acyclic chromatic index of triangle-free 1-planar graphs
- Acyclic edge coloring of triangle-free 1-planar graphs
- The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
- Acyclic edge colorings of planar graphs without 4-cycles
Cites work
- 1-平面图的结构性质及其在无圈边染色上的应用
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic chromatic index of triangle-free 1-planar graphs
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
- Acyclic chromatic indices of planar graphs with large girth
- Acyclic coloring of graphs
- Acyclic colouring of 1-planar graphs
- Acyclic edge coloring of planar graphs without 4-cycles
- 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 of subcubic graphs
- Acyclic edge coloring of triangle-free 1-planar graphs
- Acyclic edge coloring through the Lovász local lemma
- Acyclic edge colorings of graphs
- Acyclic edge-coloring of planar graphs
- Acyclic edge-coloring using entropy compression
- An improved upper bound for the acyclic chromatic number of 1-planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- Further result on acyclic chromatic index of planar graphs
- scientific article; zbMATH DE number 3603300 (Why is no real title available?)
- scientific article; zbMATH DE number 1775440 (Why is no real title available?)
- Improved bounds on coloring of graphs
- On total colorings of 1-planar graphs
This page was built for publication: Acyclic edge coloring of 1-planar graphs without 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137646)