Star edge-coloring of graphs with maximum degree four
From MaRDI portal
Publication:2007679
DOI10.1016/J.AMC.2018.08.035zbMATH Open1428.05121OpenAlexW2890158719MaRDI QIDQ2007679FDOQ2007679
Authors: Ying Wang, Yiqiao Wang, Weifan Wang 
Publication date: 22 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.08.035
Recommendations
Cites Work
- Title not available (Why is that?)
- A bound on the strong chromatic index of a graph
- On Hamiltonian bipartite graphs
- Title not available (Why is that?)
- Star Edge Coloring of Some Classes of Graphs
- A Stronger Bound for the Strong Chromatic Index
- Star Chromatic Index
- Star 5-edge-colorings of subcubic multigraphs
- Strong chromatic index of graphs with maximum degree four
- List star edge-coloring of subcubic graphs
- List star edge coloring of sparse graphs
- List star chromatic index of sparse graphs
- Star chromatic index of subcubic multigraphs
- Edge-partition and star chromatic index
- An upper bound on the star chromatic index of graphs with \(\varDelta\geqslant 7\)
Cited In (7)
- An upper bound for the choice number of star edge coloring of graphs
- Star Edge Coloring of the Cartesian Product of Graphs
- Star edge-coloring of square grids
- On star edge colorings of bipartite and subcubic graphs
- List star edge-coloring of claw-free subcubic multigraphs
- List star edge coloring of generalized Halin graphs
- Star edge coloring of graphs with Mad(G)< 14/5
This page was built for publication: Star edge-coloring of graphs with maximum degree four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007679)
