Equitable edge chromatic number of P_m S_n^0 and S_m^0 S_n^0

DOI10.31801/CFSUASMAS.524481MaRDI QIDQ5085697zbMATH OpenOpenAlexFDO

Authors J. Veninstine Vivik

Publication date 27 June 2022

Published in Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.31801/cfsuasmas.524481

zbMATH Keywords

tensor productcrown graphequitable edge coloring

Mathematics Subject Classification ID

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

Recommendations

• Equitable edge coloring on tensor product of graphs
• An algorithmic approach to equitable total chromatic number of graphs
• scientific article; zbMATH DE number 7714105
• Equitable edge chromatic number of Mycielskian of graphs
• On the equitable total chromatic number of \(P_n\vee K_{m,n}\)

Cites work

• scientific article; zbMATH DE number 6470667 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A sufficient condition for equitable edge-colourings of simple graphs
• Equitable Coloring
• Equitable colorings of Kronecker products of graphs
• Equitable edge chromatic number of Mycielskian of graphs
• Equitable edge-colorings of simple graphs
• Graph theory with applications
• The Kronecker Product of Graphs

Cited in

(3)

• scientific article; zbMATH DE number 6453790 (Why is no real title available?)
• The equitable total chromatic number of \(S_m\vee S_n\)
• Equitable edge coloring on tensor product of graphs

This page was built for publication: Equitable edge chromatic number of \(P_m\otimes S_n^0\) and \(S_m^0\otimes S_n^0\)

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