Star edge-coloring of graphs with maximum degree four
From MaRDI portal
(Redirected from Star edge-coloring of graphs with maximum degree four)
Recommendations
Cites work
- A bound on the strong chromatic index of a graph
- A stronger bound for the strong chromatic index
- An upper bound on the star chromatic index of graphs with 7
- Edge-partition and star chromatic index
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- List star chromatic index of sparse graphs
- List star edge coloring of sparse graphs
- List star edge-coloring of subcubic graphs
- On Hamiltonian bipartite graphs
- Star 5-edge-colorings of subcubic multigraphs
- Star Chromatic Index
- Star chromatic index of subcubic multigraphs
- Star edge coloring of some classes of graphs
- Strong chromatic index of graphs with maximum degree four
Cited in
(8)- An upper bound for the choice number of star edge coloring of graphs
- 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 square grids
- Star edge coloring of the Cartesian product of graphs
- Star edge-colorings of plane graphs with cycle conditions
- Star edge coloring of graphs with \(\mathrm{Mad}(G)<\frac{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)
