An upper bound for the choice number of star edge coloring of graphs
From MaRDI portal
Publication:2008856
DOI10.1016/j.amc.2018.12.016zbMath1428.05097OpenAlexW2905740390MaRDI QIDQ2008856
Jiguo Yu, Chun Hua Yang, Jian-Sheng Cai
Publication date: 26 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.12.016
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Star chromatic index of subcubic graphs
- On the maximum average degree and the oriented chromatic number of a graph
- List star edge-coloring of subcubic graphs
- Star 5-edge-colorings of subcubic multigraphs
- Coloring with no 2-colored \(P_4\)'s
- Star edge-coloring of graphs with maximum degree four
- Edge-partition and star chromatic index
- Improved upper bound for the degenerate and star chromatic numbers of graphs
- Acyclic edge-coloring using entropy compression
- Star Edge Coloring of Some Classes of Graphs
- A constructive proof of the general lovász local lemma
- Star coloring bipartite planar graphs
- Star coloring of sparse graphs
- The NP-Completeness of Edge-Coloring
- Star chromatic index of subcubic multigraphs
- 6-Star-Coloring of Subcubic Graphs
- Star Chromatic Index
This page was built for publication: An upper bound for the choice number of star edge coloring of graphs
