On the adjacent strong edge chromatic number of S_m F_n
From MaRDI portal
Publication:3402846
Recommendations
- Adjacent strong edge coloring of \(P_m\vee F_n\)
- On the adjacent strong edge coloring of \(F_n\vee P_n\vee P_n\)
- On equitable adjacent strong edge chromatic number of \({P_n} \vee {S_n}\)
- On the adjacent strong edge chromatic number of path and wheel join-graph
- scientific article; zbMATH DE number 1916560
Cited in
(10)- Relations of adjacent strong chromatic indexes between graphs and their subgraphs.
- The chromatic number of adjacent-position distinguishable edge coloring of multi-joined graph \(S_m \vee P_n \vee P_n\)
- scientific article; zbMATH DE number 2073993 (Why is no real title available?)
- scientific article; zbMATH DE number 5629751 (Why is no real title available?)
- On the adjacent strong edge coloring of \(F_n\vee P_n\vee P_n\)
- scientific article; zbMATH DE number 1916560 (Why is no real title available?)
- scientific article; zbMATH DE number 2200929 (Why is no real title available?)
- On equitable adjacent strong edge chromatic number of \({P_n} \vee {S_n}\)
- Adjacent strong edge coloring of \(P_m\vee F_n\)
- On the adjacent strong edge chromatic number of path and wheel join-graph
This page was built for publication: On the adjacent strong edge chromatic number of \(S_m\vee F_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3402846)
