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

DOI10.1016/J.INS.2014.08.016zbMath1355.05103OpenAlexW2061608700MaRDI QIDQ508738

Bing Yao, Xiang'en Chen, Yu-ping 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)

Cites Work

• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Concise proofs for adjacent vertex-distinguishing total colorings
• On the vertex-distinguishing proper edge-colorings of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing edge colorings of graphs
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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