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

From MaRDI portal
Publication:2514004

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




Related Items (52)

Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditionsNeighbor sum distinguishing total choosability of planar graphs without 4-cyclesNeighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristicNeighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatzNeighbor sum distinguishing total chromatic number of 2-degenerate graphsA note on the neighbor sum distinguishing total coloring of planar graphsAsymptotically optimal neighbor sum distinguishing total colorings of graphsNeighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphsA proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting trianglesNeighbor sum distinguishing edge colorings of graphs with bounded maximum average degreeNeighbor sum distinguishing total choosability of planar graphsNeighbor sum distinguishing total coloring of planar graphs without 5-cyclesNeighbor sum distinguishing total chromatic number of \(K_4\)-minor free graphNeighbor sum (set) distinguishing total choosability via the combinatorial NullstellensatzNeighbor sum distinguishing total coloring of 2-degenerate graphsThe adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cyclesNeighbor sum distinguishing total coloring of planar graphs without 4-cyclesNeighbor sum distinguishing total coloring of IC-planar graphsTotal colorings of \(F_5\)-free planar graphs with maximum degree 8Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average DegreeOn the neighbor sum distinguishing total coloring of planar graphsAdjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least elevenNeighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloringNeighbor sum distinguishing total coloring of sparse IC-planar graphsDistant total sum distinguishing index of graphsA note on asymptotically optimal neighbour sum distinguishing colouringsNeighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24Neighbor sum distinguishing total colorings of graphs with bounded maximum average degreeNeighbor sum distinguishing total colorings via the combinatorial nullstellensatzNeighbor sum distinguishing total choosability of cubic graphsNeighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10Neighbor sum distinguishing total colorings of planar graphsNeighbor sum distinguishing total choosability of planar graphs without adjacent trianglesNeighbor sum distinguishing list total coloring of subcubic graphsNeighbor sum distinguishing total coloring of triangle free IC-planar graphsNeighbor product distinguishing total coloringsGraphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbersNeighbor sum distinguishing total choice number of planar graphs without 6-cyclesNeighbor sum distinguishing total coloring of graphs with bounded treewidthNeighbor sum distinguishing total chromatic number of planar graphs without 5-cyclesNeighbor sum distinguishing total choosability of IC-planar graphsNeighbour sum distinguishing total colourings via the combinatorial nullstellensatzNeighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13On the total neighbour sum distinguishing index of graphs with bounded maximum average degreeNeighbor product distinguishing total colorings of planar graphs with maximum degree at least tenNeighbor sum distinguishing total colorings of corona of subcubic graphsAdjacent vertex distinguishing total coloring of planar graphs with maximum degree 8Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)Neighbor sum distinguishing total colorings of triangle free planar graphs



Cites Work


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