Vertex-distinguishing IE-total colorings of cycles and wheels

DOI10.13447/J.1674-5647.2014.03.04MaRDI QIDQ5498121zbMATH OpenFDO

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

Publication date 11 February 2015

Full work available at URL https://doi.org/10.13447/J.1674-5647.2014.03.04

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)

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}\)

Cited in

(2)

• Vertex distinguishing IV-total coloring of graphs
• Vertex distinguishing IE-total chromatic numbers of complete bipartite graph \(K_{5,n}\)

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)