On the adjacent strong edge coloring of F_n P_n P_n

zbMATH Open1110.05038MaRDI QIDQ3413488FDOQ3413488

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

Publication date: 12 December 2006

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

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)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Adjacent strong edge coloring and equitable adjacent strong edge coloring of the joins of paths
• Title not available (Why is that?)
• On the adjacent strong edge chromatic number of \(S_m\vee F_n\)
• Title not available (Why is that?)
• On equitable adjacent strong edge chromatic number of \({P_n} \vee {S_n}\)
• Title not available (Why is that?)
• 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)