Neighbor sum distinguishing total colorings of triangle free planar graphs

DOI10.1007/s10114-015-4114-yzbMath1317.05065OpenAlexW1983048542MaRDI QIDQ2355461

Ji Hui Wang, Qiao Ling Ma, Xue Han

Publication date: 23 July 2015

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

Full work available at URL: https://doi.org/10.1007/s10114-015-4114-y

zbMATH Keywords

neighbor sum distinguishing total coloringcombinatorial Nullstellensatztriangle free planar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Neighbor sum distinguishing total choosability of planar graphs without 4-cycles ⋮ A note on the neighbor sum distinguishing total coloring of planar graphs ⋮ Asymptotically optimal neighbor sum distinguishing total colorings of graphs ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ Neighbor sum distinguishing total coloring of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing total coloring of planar graphs without 4-cycles ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total chromatic number of planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted-1-antimagic graphs of prime power order
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Irregularity strength of regular graphs
• Edge weights and vertex colours
• On the total-neighbor-distinguishing index by sums
• 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
• Antimagic labelling of vertex weighted graphs
• Bounding the weight choosability number of a graph
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Total weight choosability of graphs
• Total weight choosability of graphs

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