scientific article; zbMATH DE number 5951674
From MaRDI portal
Publication:3171046
Recommendations
- Equitable edge chromatic number of Mycielskian of graphs
- On vertex-distinguishing-equitable edge chromatic numbers of M(S_n) and M(F_n) graphs
- On the vertex-distinguishing-equitable edge chromatic number of some join-graphs
- scientific article; zbMATH DE number 6453790
- scientific article; zbMATH DE number 2073992
- On the vertex distinguishing equitable edge-coloring of graphs
- Incidence-adjacent vertex distinguishing equitable total coloring of some Mycielski graphs
- scientific article; zbMATH DE number 2073991
- Edge-chromatic numbers of Mycielski graphs
- Vertex distinguishing equitable total chromatic number of join graphs
Cited in
(7)- On vertex-distinguishing-equitable edge chromatic numbers of M(S_n) and M(F_n) graphs
- On equitable adjacent strong edge coloring of Mycielski graph of some graphs
- On the vertex distinguishing equitable edge-coloring of graphs
- Equitable coloring of some Mycielski's graphs
- On vertex distinguishing equitable edge coloring of double graph of fan and wheel
- Equitable edge chromatic number of Mycielskian of graphs
- scientific article; zbMATH DE number 6453790 (Why is no real title available?)
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 Q3171046)