On the vertex-distinguishing edge coloring of join graph with star and complete balanced bipartite graph

zbMATH Open1098.05503MaRDI QIDQ5477338FDOQ5477338

Authors: Pengxiang Qiu, Zhongfu Zhang, Liang Bian, Huiying Qiang, Fugang Chao 

Publication date: 3 July 2006

Recommendations

• On the vertex-distinguishing edge coloring of \(S_n \vee K_{n,n}\)
• On the vertex-distinguishing edge coloring of \(P_m\vee P_n\)
• On the vertex-distinguishing-equitable edge chromatic number of some join-graphs
• On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
• On the vertex-distinguishing edge chromatic number of \(P_m\vee W_n\)

zbMATH Keywords

vertex-distinguishing edge-coloring

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 (5)

• On the vertex-distinguishing proper edge coloring of composition of complete graph and star
• Vertex-distinguishing proper edge coloring of composition of complete graph and star
• On the vertex-distinguishing-equitable edge chromatic number of some join-graphs
• On the vertex-distinguishing edge coloring of \(S_n \vee K_{n,n}\)
• On the vertex-distinguishing edge coloring of \(P_m\vee P_n\)

This page was built for publication: On the vertex-distinguishing edge coloring of join graph with star and complete balanced bipartite graph

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