Semistrong edge coloring of graphs
From MaRDI portal
Publication:4680403
Recommendations
Cited in
(9)- Total dominating sequences in graphs
- \((1, 0)\)-relaxed strong edge list coloring of planar graphs with girth \(6\)
- Grundy domination and zero forcing in Kneser graphs
- Large rainbow matchings in semi-strong edge-colorings of graphs
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Revisiting semistrong edge‐coloring of graphs
- A note on semi-coloring of graphs
- Semi-strong chromatic number of a graph
- On \((s,t)\)-relaxed strong edge-coloring of graphs
This page was built for publication: Semistrong edge coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680403)