Neighbor sum distinguishing total coloring of triangle free IC-planar graphs

DOI10.1007/s10114-020-9189-4zbMath1439.05096OpenAlexW3009618329MaRDI QIDQ1987570

Wen Yao Song, Lian-Ying Miao, Yuan-Yuan Duan

Publication date: 15 April 2020

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-020-9189-4

zbMATH Keywords

maximum degreeneighbor sum distinguishing total coloringcombinatorial Nullstellensatztriangle free IC-planar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (1)

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

Cites Work

• Unnamed Item
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of 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
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• Asymptotically optimal neighbor sum distinguishing total colorings of graphs
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Chromatic number, independence ratio, and crossing number
• Combinatorial Nullstellensatz

This page was built for publication: Neighbor sum distinguishing total coloring of triangle free IC-planar graphs