Neighbor sum distinguishing coloring of some graphs
From MaRDI portal
Publication:4903632
DOI10.1142/S1793830912500474zbMATH Open1257.05040MaRDI QIDQ4903632FDOQ4903632
Authors: Aijun Dong, Guanghui Wang 
Publication date: 24 January 2013
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- On vertex-coloring 13-edge-weighting
- Adjacent strong edge coloring of graphs
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Graph theory with applications
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- \(r\)-strong edge colorings of graphs
- Coloring the square of a planar graph
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On the neighbour-distinguishing index of a graph
Cited In (26)
- A note on face coloring entire weightings of plane graphs
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
- On the neighbor sum distinguishing index of planar graphs
- Neighbor sum distinguishing index of 2-degenerate graphs
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Neighbor sum distinguishing edge coloring of the join of paths
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- Title not available (Why is that?)
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Equitable neighbour-sum-distinguishing edge and total colourings
- Two smaller upper bounds of List injective chromatic number
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing edge coloring of the lexicographic product of paths
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- On generalized neighbor sum distinguishing index of planar graphs
- Title not available (Why is that?)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- On the neighbour-distinguishing index of a graph
- Neighbor sum distinguishing edge coloring of subcubic graphs
This page was built for publication: Neighbor sum distinguishing coloring of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903632)
