Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs

DOI10.1007/s11464-013-0322-xzbMath1306.05066OpenAlexW1976013119MaRDI QIDQ2514004

Bingqiang Liu, Hualong Li, Guang-Hui Wang

Publication date: 29 January 2015

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-013-0322-x

zbMATH Keywords

\(K_4\)-minor free graphneighbor sum distinguishing

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (52)

Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ 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 ⋮ A note on the neighbor sum distinguishing total coloring of planar graphs ⋮ Asymptotically optimal neighbor sum distinguishing total colorings of graphs ⋮ Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ 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 (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 planar graphs without 4-cycles ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs ⋮ Total colorings of \(F_5\)-free planar graphs with maximum degree 8 ⋮ 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 ⋮ Distant total sum distinguishing index of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ Neighbor sum distinguishing total choosability of cubic graphs ⋮ 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 ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Neighbor product distinguishing total colorings ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles ⋮ 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 ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ 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 colorings of planar graphs with maximum degree \(\varDelta\) ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• A bound on the total chromatic number
• The total chromatic number of any multigraph with maximum degree five is at most seven
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On the total coloring of certain graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• On Total Chromatic Number of a Graph

This page was built for publication: Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs