A note on strong edge coloring of sparse graphs
From MaRDI portal
Publication:1734962
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?)
- A bound on the strong chromatic index of a graph
- Graph theory
- Induced matchings in cubic graphs
- On the degrees of the vertices of a directed graph
- Problems and results in combinatorial analysis and graph theory
- Strong chromatic index of 2-degenerate graphs
- Strong chromatic index of \(k\)-degenerate graphs
- Strong chromatic index of sparse graphs
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- Strong edge-colorings for \(k\)-degenerate graphs
- The strong chromatic index of a cubic graph is at most 10
- The strong chromatic index of sparse graphs
Cited in
(6)- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- On the chromatic number of a family of odd hole free graphs
- Strong edge-colorings of sparse graphs with large maximum degree
- On strongly spanning k-edge-colorable subgraphs
- Strong edge coloring sparse graphs
- Strong edge-colouring of sparse planar graphs
This page was built for publication: A note on strong edge coloring of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734962)