On the adjacent strong edge coloring of F_n P_n P_n

MaRDI QIDQ3413488zbMATH OpenFDO

Authors Xiao Ping Wang, Jingwen Li, Liang Bian, Zhongfu Zhang

Publication date 12 December 2006

zbMATH Keywords

pathjoin graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Adjacent strong edge coloring of \(P_m\vee F_n\)
• On the adjacent strong edge chromatic number of \(S_m\vee F_n\)
• On equitable adjacent strong edge chromatic number of \({P_n} \vee {S_n}\)
• scientific article; zbMATH DE number 1916560
• On the adjacent strong edge chromatic number of path and wheel join-graph

Cited in

(9)

• scientific article; zbMATH DE number 5905150 (Why is no real title available?)
• scientific article; zbMATH DE number 5024672 (Why is no real title available?)
• Adjacent strong edge coloring and equitable adjacent strong edge coloring of the joins of paths
• scientific article; zbMATH DE number 5629751 (Why is no real title available?)
• On the adjacent strong edge chromatic number of \(S_m\vee F_n\)
• scientific article; zbMATH DE number 5583413 (Why is no real title available?)
• On equitable adjacent strong edge chromatic number of \({P_n} \vee {S_n}\)
• scientific article; zbMATH DE number 5284422 (Why is no real title available?)
• Adjacent strong edge coloring of \(P_m\vee F_n\)

This page was built for publication: On the adjacent strong edge coloring of \(F_n\vee P_n\vee P_n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3413488)