Vertex-distinguishing IE-total colorings of cycles and wheels

DOI10.13447/J.1674-5647.2014.03.04zbMATH Open1313.05112MaRDI QIDQ5498121FDOQ5498121

Zepeng Li, Xiang'en Chen, Bing Yao, Wen-Yu He

Publication date: 11 February 2015

Recommendations

• Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\))
• Remarks on vertex-distinguishing IE-total coloring of complete bipartite graphs \(K_{4,n}\) and \(K_{n,n}\)
• Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{9,n}\)
• Vertex distinguishing IE-total chromatic numbers of complete bipartite graph \(K_{5,n}\)
• Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{8,n}\)

zbMATH Keywords

simple graphIE-total coloringvertex-distinguishing IE-total chromatic numbervertex-distinguishing IE-total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Vertex-distinguishing IE-total colorings of cycles and wheels

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