scientific article; zbMATH DE number 6453790

zbMATH Open1324.05074MaRDI QIDQ5260419FDOQ5260419

Authors: Junqiao Zhu, Yuehua Bu 

Publication date: 29 June 2015

Title of this publication is not available (Why is that?)

Recommendations

• On vertex-distinguishing-equitable edge chromatic numbers of \(M(S_n)\) and \(M(F_n)\) graphs
• scientific article; zbMATH DE number 5140854
• On the vertex-distinguishing-equitable edge chromatic number of some join-graphs
• On the vertex-distinguishing edge chromatic number of \(P_m\vee W_n\)
• scientific article; zbMATH DE number 5951674
• Equitable edge chromatic number of \(P_m\otimes S_n^0\) and \(S_m^0\otimes S_n^0\)
• On the vertex distinguishing equitable edge-coloring of graphs
• On the adjacent vertex-distinguishing edge chromatic number of \(W_m\vee W_n\)
• On the adjacent vertex-distinguishing edge chromatic number of \(W_m\vee W_n\)
• On equitable adjacent strong edge chromatic number of \({P_n} \vee {S_n}\)

zbMATH Keywords

edge coloringfanwheelstarjoin graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication:

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