Strong chromatic index of sparse graphs
From MaRDI portal
Recommendations
Cites work
- A bound on the strong chromatic index of a graph
- 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
- On the degrees of the vertices of a directed graph
- Strong chromatic index of \(k\)-degenerate graphs
- Strong chromatic index of 2-degenerate graphs
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- The game coloring number of planar graphs
- The Map-Coloring Game
- 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
- The strong chromatic index of sparse graphs
- Very asymmetric marking games
Cited in
(9)- A note on strong edge coloring of sparse graphs
- Strong chromatic index of \(k\)-degenerate graphs
- List strong edge-coloring of graphs with maximum degree 4
- Uniform orderings for generalized coloring numbers
- Strong chromatic index in subset graphs
- Strong chromatic index of unit distance graphs
- The strong chromatic index of sparse graphs
- Strong edge-colorings for \(k\)-degenerate graphs
- A Combinatorial Classic — Sparse Graphs with High Chromatic Number
This page was built for publication: Strong chromatic index of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833251)