Equitable edge coloring on tensor product of graphs
From MaRDI portal
Publication:5083505
Recommendations
Cites work
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A note on adjacent strong edge coloring of \(K(n,m)\)
- A sufficient condition for equitable edge-colourings of simple graphs
- Equitable Coloring
- Equitable edge chromatic number of Mycielskian of graphs
- Graph theory with applications
- The Kronecker Product of Graphs
Cited in
(5)- \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture
- scientific article; zbMATH DE number 7714105 (Why is no real title available?)
- Equitable edge chromatic number of \(P_m\otimes S_n^0\) and \(S_m^0\otimes S_n^0\)
- Equitable edge chromatic number of Mycielskian of graphs
- Equitable strongly balanced edge coloring of graphs.
This page was built for publication: Equitable edge coloring on tensor product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5083505)