Neighbor sum distinguishing index of planar graphs
From MaRDI portal
Publication:396740
DOI10.1016/J.DISC.2014.06.027zbMATH Open1298.05136OpenAlexW2161246626MaRDI QIDQ396740FDOQ396740
Authors: Zhumin Chen, Guanghui Wang, Jihui Wang 
Publication date: 14 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.027
Recommendations
- Neighbor sum distinguishing coloring of some graphs
- On generalized neighbor sum distinguishing index of planar graphs
- On the neighbor sum distinguishing index of planar graphs
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- On Neighbor-Distinguishing Index of Planar Graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Adjacent strong edge coloring of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Graph theory with applications
- Neighbor sum distinguishing index
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Irregularity strength of regular graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Antimagic labelling of vertex weighted graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Weighted-1-antimagic graphs of prime power order
- Neighbor sum distinguishing coloring of some graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- \(r\)-strong edge colorings of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On the neighbour-distinguishing index of a graph
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- An improved bound on acyclic chromatic index of planar graphs
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
Cited In (32)
- 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
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- Neighbor sum distinguishing index
- On the neighbor sum distinguishing index of planar graphs
- Neighbor sum distinguishing index of 2-degenerate graphs
- On the neighbor-distinguishing indices of planar graphs
- Distant sum distinguishing index of graphs
- Neighbor sum distinguishing index of subcubic graphs
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- Distant sum distinguishing index of graphs with bounded minimum degree
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- A note on asymptotically optimal neighbour sum distinguishing colourings
- On Neighbor-Distinguishing Index of Planar Graphs
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- Neighbor sum distinguishing coloring of some graphs
- General neighbour-distinguishing index of a graph
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Title not available (Why is that?)
- Neighbor-sum-distinguishing edge choosability of subcubic graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- List neighbor sum distinguishing edge coloring of subcubic graphs
- On generalized neighbor sum distinguishing index of planar graphs
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- Neighbor sum distinguishing edge coloring of subcubic graphs
This page was built for publication: Neighbor sum distinguishing index of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396740)
