Strong edge colouring of subcubic graphs
From MaRDI portal
Publication:642999
DOI10.1016/J.DAM.2011.06.015zbMATH Open1228.05152OpenAlexW1969425709MaRDI QIDQ642999FDOQ642999
Authors: Hervé Hocquard, Petru Valicov 
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.015
Recommendations
- On strong edge-colouring of subcubic graphs
- Strong edge-coloring of subcubic planar graphs
- Bounds and complexity results for strong edge colouring of subcubic graphs
- Between proper and strong edge‐colorings of subcubic graphs
- Between Proper and Strong Edge-Colorings of Subcubic Graphs
- Strong list edge coloring of subcubic graphs
- Strong edge colorings of graphs
- On strong list edge coloring of subcubic graphs
- scientific article; zbMATH DE number 3882451
- Strong edge-coloring for cubic Halin graphs
Cites Work
Cited In (19)
- On strong list edge coloring of subcubic graphs
- Strong list edge coloring of subcubic graphs
- Odd edge-colorability of subcubic graphs
- Strong edge-coloring of subcubic planar graphs
- Proof of a conjecture on the strong chromatic index of Halin graphs
- Θ-graphs of partial cubes and strong edge colorings
- On strong edge-colouring of subcubic graphs
- Strong edge-coloring of pseudo-Halin graphs
- On strongly spanning k-edge-colorable subgraphs
- Strong edge-coloring of planar graphs
- On strong edge-coloring of graphs with maximum degree 4
- Between proper and strong edge‐colorings of subcubic graphs
- Strong chromatic index of subcubic planar multigraphs
- Recent progress on strong edge-coloring of graphs
- On the strong chromatic index of sparse graphs
- Strong edge colorings of graphs and the covers of Kneser graphs
- Strong chromatic index of graphs with maximum degree four
- The tight bound for the strong chromatic indices of claw-free subcubic graphs
- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
This page was built for publication: Strong edge colouring of subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642999)
