Acyclic edge coloring of 4-regular graphs without 3-cycles
From MaRDI portal
Publication:1712783
DOI10.1007/s40840-017-0484-xzbMath1406.05040OpenAlexW2604473403MaRDI QIDQ1712783
Yulai Ma, Qiaojun Shu, Wei Fan Wang, Yi Qiao Wang
Publication date: 31 January 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-017-0484-x
Related Items
Unnamed Item, Acyclic edge coloring of 4-regular graphs. II., Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles, Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles, Acyclic edge coloring of chordal graphs with bounded degree
Cites Work
- Unnamed Item
- Unnamed Item
- Some results on acyclic edge coloring of plane graphs
- Improved bounds on coloring of graphs
- Acyclic edge coloring of planar graphs without 5-cycles
- Acyclic chromatic indices of planar graphs with girth at least five
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic colorings of subcubic graphs
- Further result on acyclic chromatic index of planar graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge coloring of planar graphs without 4-cycles
- Acyclic chromatic indices of planar graphs with large girth
- Acyclic edge-coloring using entropy compression
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic edge coloring of 2-degenerate graphs
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic coloring of graphs
- Optimal acyclic edge‐coloring of cubic graphs
- Acyclic chromatic indices of <italic>K</italic><sub>4</sub>-minor free graphs
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
