On strong edge-colouring of subcubic graphs
From MaRDI portal
Publication:2444538
Recommendations
Cites work
- scientific article; zbMATH DE number 3882451 (Why is no real title available?)
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- Induced matchings in cubic graphs
- Problems and results in combinatorial analysis and graph theory
- Strong edge colouring of subcubic graphs
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- The strong chromatic index of a cubic graph is at most 10
Cited in
(43)- List star edge-coloring of subcubic graphs
- On the strong chromatic index of sparse graphs
- Strong chromatic index of graphs with maximum degree four
- On strong edge-coloring of graphs with maximum degree 4
- Upper bounds for the strong chromatic index of Halin graphs
- On S-packing edge-colorings of cubic graphs
- Proof of a conjecture on the strong chromatic index of Halin graphs
- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
- On strong edge-coloring of claw-free subcubic graphs
- Strong edge-coloring of pseudo-Halin graphs
- Strong edge-colorings of sparse graphs with large maximum degree
- Strong edge-colorings of planar graphs with small girth
- Odd edge-colorability of subcubic graphs
- Bounds and complexity results for strong edge colouring of subcubic graphs
- Strong edge-coloring of subcubic planar graphs
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- Θ-graphs of partial cubes and strong edge colorings
- On strong list edge coloring of subcubic graphs
- Strong list edge coloring of subcubic graphs
- Strong edge-colouring of sparse planar graphs
- A note on strong edge choosability of toroidal subcubic graphs
- Strong chromatic index of subcubic planar multigraphs
- A \((1,0)\)-relaxed strong list coloring of planar subcubic graphs
- Between Proper and Strong Edge-Colorings of Subcubic Graphs
- From light edges to strong edge-colouring of 1-planar graphs
- \((1, 0)\)-relaxed strong edge list coloring of planar graphs with girth \(6\)
- Recent progress on strong edge-coloring of graphs
- On strongly spanning k-edge-colorable subgraphs
- Strong edge-coloring of planar graphs
- Between proper and strong edge‐colorings of subcubic graphs
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
- Strong edge colorings of graphs and the covers of Kneser graphs
- The tight bound for the strong chromatic indices of claw-free subcubic graphs
- Injective edge-coloring of subcubic graphs
- Strong edge-coloring of some sparse graphs
- Proper edge-colorings with a rich neighbor requirement
- Strong edge colouring of subcubic graphs
- Properly edge-coloured subgraphs in colourings of bounded degree
- Strong edge coloring of subquartic graphs
- On the rich-neighbor edge-coloring of sparse graphs
- Strong chromatic index of graphs with small girth
- Strong chromatic index of sparse graphs with maximum degree 4
- Strong edge chromatic index of subquartic graphs
This page was built for publication: On 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 Q2444538)
