Strong chromatic indices of certain binary operations on graphs
From MaRDI portal
Cites work
- A conjecture on amalgamation of graceful graphs with star graphs
- A new graph product and its spectrum
- A note on the strong chromatic index of bipartite graphs
- A stronger bound for the strong chromatic index (extended abstract)
- Adjacency and Laplacian spectra of variants of neighborhood corona of graphs constrained by vertex subsets
- scientific article; zbMATH DE number 2191991 (Why is no real title available?)
- Incidence and strong edge colorings of graphs
- Induced matchings in bipartite graphs
- On strong edge-coloring of graphs with maximum degree 4
- On the computational complexity of strong edge coloring
- Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs
- Strong chromatic index of graphs with maximum degree four
- Strong chromatic index of products of graphs
- Strong edge coloring sparse graphs
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- Strong edge-coloring of planar graphs
- Strong edge-colorings of sparse graphs with large maximum degree
- Strong edge-colouring of sparse planar graphs
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs
- The strong chromatic index of a cubic graph is at most 10
- Weighted PI index of corona product of graphs
This page was built for publication: Strong chromatic indices of certain binary operations on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983430)