Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13

DOI10.1007/s10878-019-00467-1zbMath1434.05057OpenAlexW2985225588MaRDI QIDQ2292143

Chao Song, Changqing Xu

Publication date: 3 February 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00467-1

zbMATH Keywords

neighbor sum distinguishing total coloringdischarging methodIC-planar graph

Mathematics Subject Classification ID

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

Related Items (2)

Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10

Cites Work

• Unnamed Item
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• List edge and list total coloring of 1-planar graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• On edge colorings of \(1\)-planar graphs
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs
• On the total-neighbor-distinguishing index by sums
• On total colorings of 1-planar graphs
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Asymptotically optimal neighbor sum distinguishing total colorings of graphs
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Chromatic number, independence ratio, and crossing number
• Combinatorial Nullstellensatz

This page was built for publication: Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13