scientific article; zbMATH DE number 4177085
From MaRDI portal
Recommendations
Cited in
(36)- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- The strong chromatic index ofC4-free graphs
- Induced matchings in cubic graphs
- List strong edge coloring of planar graphs with maximum degree 4
- List strong edge-coloring of graphs with maximum degree 4
- Recent progress on strong edge-coloring of graphs
- Randomly colouring graphs (a combinatorial view)
- The strong chromatic index of graphs with restricted Ore-degrees.
- An algorithm on strong edge coloring of \(K_4\)-minor free graphs
- Strong chromatic index of \(K_{1, t}\)-free graphs
- A stronger bound for the strong chromatic index
- The tight bound for the strong chromatic indices of claw-free subcubic graphs
- Proof of a conjecture on the strong chromatic index of Halin graphs
- The strong chromatic index of graphs with edge weight eight
- A bound on the strong chromatic index of a graph
- Strong edge-coloring for cubic Halin graphs
- scientific article; zbMATH DE number 5079511 (Why is no real title available?)
- On strong edge-coloring of graphs with maximum degree 4
- The strong chromatic index of a class of graphs
- Upper bounds for the strong chromatic index of Halin graphs
- Induced matchings in graphs of degree at most 4
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- Strong edge coloring of Cayley graphs and some product graphs
- On the strong chromatic index of cyclic multigraphs
- The strong chromatic index of a cubic graph is at most 10
- Strong chromatic index of products of graphs
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- Fractional strong chromatic index of bipartite graphs
- Strong chromatic index of chordless graphs
- Strong chromatic index of graphs with maximum degree four
- On \((s,t)\)-relaxed strong edge-coloring of graphs
- Strong edge-coloring for jellyfish graphs
- Strong chromatic index of \(K_4\)-minor free graphs
- Strong cliques in claw-free graphs
- The Strong Chromatic Index of Random Graphs
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201075)
