Neighbor product distinguishing total colorings

Tong Li, Cunquan Qu, Guanghui Wang () and Xiaowei Yu
Additional contact information
Tong Li: Shandong University
Cunquan Qu: Shandong University
Guanghui Wang: Shandong University
Xiaowei Yu: Shandong University

Journal of Combinatorial Optimization, 2017, vol. 33, issue 1, No 16, 237-253

Abstract: Abstract A total-[k]-coloring of a graph G is a mapping $$\phi : V (G) \cup E(G)\rightarrow \{1, 2, \ldots , k\}$$ ϕ : V ( G ) ∪ E ( G ) → { 1 , 2 , … , k } such that any two adjacent elements in $$V (G) \cup E(G)$$ V ( G ) ∪ E ( G ) receive different colors. Let f(v) denote the product of the color of a vertex v and the colors of all edges incident to v. A total-[k]-neighbor product distinguishing-coloring of G is a total-[k]-coloring of G such that $$f(u)\ne f(v)$$ f ( u ) ≠ f ( v ) , where $$uv\in E(G)$$ u v ∈ E ( G ) . By $$\chi ^{\prime \prime }_{\prod }(G)$$ χ ∏ ″ ( G ) , we denote the smallest value k in such a coloring of G. We conjecture that $$\chi _{\prod }^{\prime \prime }(G)\le \Delta (G)+3$$ χ ∏ ″ ( G ) ≤ Δ ( G ) + 3 for any simple graph with maximum degree $$\Delta (G)$$ Δ ( G ) . In this paper, we prove that the conjecture holds for complete graphs, cycles, trees, bipartite graphs and subcubic graphs. Furthermore, we show that if G is a $$K_4$$ K 4 -minor free graph with $$\Delta (G)\ge 4$$ Δ ( G ) ≥ 4 , then $$\chi _{\prod }^{\prime \prime }(G)\le \Delta (G)+2$$ χ ∏ ″ ( G ) ≤ Δ ( G ) + 2 .

Keywords: Proper total coloring; Neighbor product distinguishing; Maximum degree; Neighbor product distinguishing total chromatic number (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9952-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9952-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9952-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().