Acyclic list edge coloring of graphs with maximum degree 4
From MaRDI portal
Publication:5037979
Authors: Juan Wang, Lianying Miao, Jiansheng Cai 
Publication date: 29 September 2022
Full work available at URL: https://www.actamath.com/Jwk_sxxb_cn/EN/10.12386/A20220012
Recommendations
Cites Work
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic edge colorings of graphs
- Acyclic coloring of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total coloring of planar graphs without 6-cycles
- Acyclic edge-coloring using entropy compression
- Improved bounds on coloring of graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge-coloring of planar 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 edge coloring through the Lovász local lemma
- Further result on acyclic chromatic index of planar graphs
- Acyclic edge coloring of 4-regular graphs without 3-cycles
- Acyclic list edge coloring of outerplanar graphs
- Acyclic list edge coloring of planar graphs
- Acyclic list edge coloring of graphs
- Acyclic edge coloring of 4-regular graphs. II.
Cited In (3)
This page was built for publication: Acyclic list edge coloring of graphs with maximum degree 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037979)
