Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
type: Item
instance of: scholarly article
title: Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
zbMATH Open document ID: 1468.05072
author: Aijun Dong
author: Tong Li
publication date: 2021-07-21T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7373293
zbMATH Keywords: total coloring
zbMATH Keywords: neighbor product distinguishing coloring
zbMATH Keywords: planar graph
MaRDI profile type: Publication
full work available at URL: dmgt.2221
OpenAlex ID: W2943461525
cites work: Combinatorial Nullstellensatz
cites work: Q3097395
cites work: On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
cites work: The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
cites work: The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
cites work: Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
cites work: Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
cites work: Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
cites work: Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
cites work: Neighbor product distinguishing total colorings
cites work: Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
cites work: Neighbor sum distinguishing total colorings of planar graphs
cites work: Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
cites work: Neighbor sum distinguishing list total coloring of subcubic graphs
cites work: On the neighbor sum distinguishing total coloring of planar graphs
cites work: Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
cites work: The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
cites work: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
cites work: Q3011715
cites work: Adjacent vertex distinguishing total colorings of outerplanar graphs
cites work: Adjacent vertex distinguishing total coloring of graphs with lower average degree
cites work: The adjacent vertex distinguishing total coloring of planar graphs
cites work: Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
cites work: On adjacent-vertex-distinguishing total coloring of graphs
Wikidata QID: Q127972863
DOI: 10.7151/DMGT.2221
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 7373293