A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
type: Item
instance of: scholarly article
title: A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
zbMATH Open document ID: 1395.05058
author: Jingjing Huo
author: Weifan Wang
author: Yiqiao Wang
published in: Discrete Mathematics
publication date: 2018-09-21T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6941030
zbMATH Keywords: planar graph
zbMATH Keywords: neighbor-distinguishing total coloring
zbMATH Keywords: discharging
zbMATH Keywords: combinatorial nullstellensatz
MaRDI profile type: Publication
full work available at URL: j.disc.2018.07.011
OpenAlex ID: W2886078157
cites work: Combinatorial Nullstellensatz
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 chromatic number
cites work: Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
cites work: A note on the adjacent vertex distinguishing total chromatic number of graphs
cites work: Concise proofs for adjacent vertex-distinguishing total colorings
cites work: Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
cites work: AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
cites work: On the AVDTC of 4-regular graphs
cites work: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
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
DOI: 10.1016/J.DISC.2018.07.011
Recommended article: Neighbor sum distinguishing total chromatic number of planar graphs
Recommended article: The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
Recommended article: Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
Recommended article: Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
Recommended article: Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
Recommended article: On the neighbor sum distinguishing total coloring of planar graphs
Recommended article: A note on the neighbor sum distinguishing total coloring of planar graphs
Recommended article: Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
Recommended article: Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
Recommended article: Q4604358
description: scientific article; zbMATH DE number 6941030