On the vertex-distinguishing-equitable edge chromatic number of some join-graphs

MaRDI QIDQ5309641zbMATH OpenFDO

Authors Zhongfu Zhang, Jingwen Li, Chuancheng Zhao, Zhiguo Ren, Jianfang Wang

Publication date 9 October 2007

zbMATH Keywords

cyclepathjoin-graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• On the vertex-distinguishing edge coloring of \(P_m\vee P_n\)
• On the vertex-distinguishing edge chromatic number of \(P_m\vee W_n\)
• On the vertex-distinguishing edge coloring of \(S_n \vee K_{n,n}\)
• Vertex distinguishing equitable total chromatic number of join graphs
• On the vertex-distinguishing edge coloring of join graph with star and complete balanced bipartite graph

Cited in

(9)

• On the vertex-distinguishing-equitable edge chromatic numbers of some product graphs
• scientific article; zbMATH DE number 5951674 (Why is no real title available?)
• scientific article; zbMATH DE number 6453790 (Why is no real title available?)
• Vertex distinguishing equitable total chromatic number of join graphs
• On the vertex-distinguishing edge coloring of \(P_m\vee P_n\)
• On the vertex-distinguishing edge chromatic number of \(P_m\vee W_n\)
• On vertex distinguishing equitable edge coloring of double graph of fan and wheel
• On vertex-distinguishing-equitable edge chromatic numbers of \(M(S_n)\) and \(M(F_n)\) graphs
• On the vertex-distinguishing edge coloring of join graph with star and complete balanced bipartite graph

This page was built for publication: On the vertex-distinguishing-equitable edge chromatic number of some join-graphs

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