Neighbor product distinguishing total colorings

DOI10.1007/s10878-015-9952-0zbMath1365.05093OpenAlexW2219816326MaRDI QIDQ512884

Xiaowei Yu, Tong Li, Cun-quan Qu, Guang-Hui Wang

Publication date: 3 March 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9952-0

zbMATH Keywords

maximum degreeneighbor product distinguishingneighbor product distinguishing total chromatic numberproper total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On a list variant of the multiplicative 1-2-3 conjecture, Neighbor product distinguishing total colorings of 2-degenerate graphs, Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten

Cites Work

• Unnamed Item
• Unnamed Item
• Multiplicative vertex-colouring weightings of graphs
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• 1,2 conjecture-the multiplicative version
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Edge weights and vertex colours
• On the total-neighbor-distinguishing index by sums
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree