NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS

DOI10.1142/S1793830912500474zbMath1257.05040MaRDI QIDQ4903632

Aijun Dong, Guang-Hui Wang

Publication date: 24 January 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

planar graphneighbor sum distinguishing coloringproper edge coloring

Mathematics Subject Classification ID

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

Related Items

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ On generalized neighbor sum distinguishing index of planar graphs ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ Neighbor sum distinguishing index of planar graphs ⋮ An improved upper bound for the neighbor sum distinguishing index of graphs ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ A note on face coloring entire weightings of plane graphs ⋮ Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ Neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Two smaller upper bounds of List injective chromatic number ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs

Cites Work

• Unnamed Item
• On the neighbour-distinguishing index of a graph
• \(r\)-strong edge colorings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• On vertex-coloring 13-edge-weighting
• Adjacent strong edge coloring of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Coloring the square of a planar graph
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS