scientific article; zbMATH DE number 7594585
From MaRDI portal
Publication:5037979
Juan Wang, Lian-Ying Miao, Jian-Sheng Cai
Publication date: 29 September 2022
Full work available at URL: https://www.actamath.com/Jwk_sxxb_cn/EN/10.12386/A20220012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds on coloring of graphs
- Acyclic edge coloring through the Lovász local lemma
- Total coloring of planar graphs without 6-cycles
- Further result on acyclic chromatic index of planar graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of 4-regular graphs without 3-cycles
- Acyclic list edge coloring of outerplanar graphs
- Acyclic edge coloring of 4-regular graphs. II.
- 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
- Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- Acyclic List Edge Coloring of Graphs
This page was built for publication:
