Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions

DOI10.1080/09720529.2021.1961895zbMath1483.05066OpenAlexW3202932982MaRDI QIDQ5035848

Dong Han Zhang

Publication date: 22 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2021.1961895

zbMATH Keywords

combinatorial nullstellensatzneighbor sum distinguishing total choice numberNIC-planar graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total choosability of planar graphs
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• Neighbor sum distinguishing list total coloring of subcubic graphs
• Neighbor sum distinguishing total choosability of cubic graphs
• Neighbor sum distinguishing total choosability of IC-planar graphs
• On the total-neighbor-distinguishing index by sums
• Ein Sechsfarbenproblem auf der Kugel
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Combinatorial Nullstellensatz
• List edge and list total coloring of planar graphs without intersecting 8-cycles

This page was built for publication: Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions