Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10

DOI10.1016/J.AMC.2017.06.002zbMath1426.05051OpenAlexW2745207219MaRDI QIDQ1740118

Xiaowei Yu, Shan Zhou, Lin Sun, Donglei Yang, Jian Liang Wu

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.06.002

zbMATH Keywords

planar graphneighbor sum distinguishing total coloringcombinatorial Nullstellensatzdischarging

Mathematics Subject Classification ID

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

Related Items (21)

Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ Neighbor sum distinguishing total choosability of cubic graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs

Cites Work

• Unnamed Item
• Neighbor sum distinguishing total choosability of planar graphs
• The adjacent vertex distinguishing total chromatic number
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• On the neighbor sum distinguishing total coloring of planar graphs
• Irregularity strength of regular graphs
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Asymptotically optimal neighbor sum distinguishing total colorings of graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs
• How to Define an Irregular Graph
• Combinatorial Nullstellensatz
• On the Irregularity Strength of Dense Graphs
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz

This page was built for publication: Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10