Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten

DOI10.7151/dmgt.2221zbMath1468.05072OpenAlexW2943461525WikidataQ127972863 ScholiaQ127972863MaRDI QIDQ2042610

Aijun Dong, Tong Li

Publication date: 21 July 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2221

zbMATH Keywords

planar graphtotal coloringneighbor product distinguishing coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Neighbor product distinguishing total colorings
• On the neighbor sum distinguishing total coloring of planar graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• Neighbor sum distinguishing list total coloring of subcubic graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• The adjacent vertex distinguishing total coloring of planar graphs
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree

This page was built for publication: Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten