Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree

DOI10.1007/s10114-014-2454-7zbMath1408.05061OpenAlexW2057166029MaRDI QIDQ2452418

Aijun Dong, Guang-Hui Wang

Publication date: 3 June 2014

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

Full work available at URL: https://doi.org/10.1007/s10114-014-2454-7

zbMATH Keywords

total coloringaverage degreeneighbor sum

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (40)

Neighbor sum distinguishing total choosability of planar graphs without 4-cycles ⋮ Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ Neighbor sum distinguishing total chromatic number of 2-degenerate graphs ⋮ Asymptotically optimal neighbor sum distinguishing total colorings of graphs ⋮ Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ 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 chromatic number of \(K_4\)-minor free graph ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ Neighbor sum distinguishing total coloring of 2-degenerate graphs ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ 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 ⋮ Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ 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 choosability of 1-planar graphs with maximum degree at least 24 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ Neighbor sum distinguishing total coloring of graphs with bounded treewidth ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs ⋮ 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 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 ⋮ Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing index
• On the total vertex irregularity strength of trees
• On irregular total labellings
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• A new upper bound for the total vertex irregularity strength of graphs
• On the total-neighbor-distinguishing index by sums
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs

This page was built for publication: Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree