Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles

DOI10.21136/CMJ.2021.0333-20MaRDI QIDQ5071596

Dong Han Zhang

Publication date: 22 April 2022

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

combinatorial Nullstellensatzdischarging methodIC-planar graphneighbor sum distinguishing list total 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
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
• Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
• On the total-neighbor-distinguishing index by sums
• Chromatic number, independence ratio, and crossing number
• Combinatorial Nullstellensatz

This page was built for publication: Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles