Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph

DOI10.1016/J.INS.2014.08.016MaRDI QIDQ508738zbMATH OpenOpenAlexFDO

Authors Xiang'en Chen, Bing Yao, Yuping Gao

Publication date 8 February 2017

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2014.08.016

zbMATH Keywords

total coloringvertex distinguishing total chromatic numbervertex distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 810447
• scientific article; zbMATH DE number 5631932
• Vertex-distinguishing total coloring of graphs
• scientific article; zbMATH DE number 5811658
• Subcolorings and the subchromatic number of a graph
• A bound of the vertex-distinguishing total chromatic number of graphs
• Chromatic number and subtrees of graphs
• Vertex-distinguishing total chromatic number of \(S_m\times S_n,S_m\times F_n\) and \(S_m\times W_n\)
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• A note on the adjacent vertex distinguishing total chromatic number of graphs

Cites work

• scientific article; zbMATH DE number 6010672 (Why is no real title available?)
• scientific article; zbMATH DE number 5011016 (Why is no real title available?)
• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• A note on general neighbor-distinguishing total coloring of graphs.
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Concise proofs for adjacent vertex-distinguishing total colorings
• On adjacent-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• On the vertex-distinguishing proper edge-colorings of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Vertex-distinguishing edge colorings of graphs
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing total coloring of graphs

Cited in

(1)

• scientific article; zbMATH DE number 810447 (Why is no real title available?)

This page was built for publication: Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph

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