Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
From MaRDI portal
Publication:5918607
DOI10.1007/978-3-030-59267-7_36OpenAlexW3109438656MaRDI QIDQ5918607
Eiji Miyano, Guo-Hui Lin, Shuguang Han, An Zhang, Qiaojun Shu, Yong Chen
Publication date: 22 December 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-59267-7_36
Related Items (2)
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
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
- Further result on acyclic chromatic index of planar graphs
- Acyclic edge coloring of 4-regular graphs without 3-cycles
- Acyclic chromatic index of planar graphs with triangles
- Acyclic edge coloring of planar graphs without 4-cycles
- Acyclic edge coloring of 4-regular graphs. II.
- Acyclic edge coloring of graphs
- Acyclic edge-coloring using entropy compression
- Acyclic edge colorings of graphs
- Acyclic Edge-Coloring of Planar 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 Planar Graphs with Girth At Least 4
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
This page was built for publication: Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
