Neighbor sum distinguishing total coloring of planar graphs without 4-cycles

DOI10.1007/S10878-017-0137-XzbMath1378.05073OpenAlexW2617791081MaRDI QIDQ1679510

Changqing Xu, Hongjie Song

Publication date: 9 November 2017

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

Full work available at URL: https://doi.org/10.1007/s10878-017-0137-x

zbMATH Keywords

planar graphcombinatorial nullstellensatzneighbor sum distinguishing total coloring

Mathematics Subject Classification ID

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

Related Items (4)

Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Neighbor sum distinguishing total chromatic number of planar graphs

Cites Work

• Unnamed Item
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• 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
• On the neighbor sum distinguishing total coloring of planar graphs
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• 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
• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Combinatorial Nullstellensatz
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz

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