Vertex-distinguishing E-total coloring of complete bipartite graph K₈,n with 8 n 34

MaRDI QIDQ7001083zbMATH OpenFDO

Authors Lan Yang, Xiang'en Chen

Publication date 7 April 2025

Published in Applied Mathematics. Series A (Chinese Edition) (Search for Journal in Brave)

Full work available at URL http://www.amjcu.zju.edu.cn/amjcua/2020-2029/202104/492-500.pdf

zbMATH Keywords

complete bipartite graphsE-total coloringvertex-distinguishing E-total chromatic numbervertex-distinguishing E-total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{8,n}\) with \(8\le n\le 34\)

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