Neighbor sum distinguishing index of planar graphs
From MaRDI portal
(Redirected from Publication:396740)
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
Cites work
- Adjacent Vertex Distinguishing Edge‐Colorings
- Adjacent strong edge coloring of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- An improved bound on acyclic chromatic index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Antimagic labelling of vertex weighted graphs
- Graph theory with applications
- Irregularity strength of regular graphs
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Neighbor sum distinguishing coloring of some graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing index
- On the neighbour-distinguishing index of a graph
- Total weight choosability of graphs
- Total weight choosability of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Weighted-1-antimagic graphs of prime power order
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- \(r\)-strong edge colorings of graphs
Cited in
(32)- Neighbor sum distinguishing index of sparse graphs
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
- On the neighbor-distinguishing indices of planar graphs
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- List neighbor sum distinguishing edge coloring of subcubic graphs
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- Distant sum distinguishing index of graphs with bounded minimum degree
- Distant sum distinguishing index of graphs
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- On generalized neighbor sum distinguishing index of planar graphs
- Neighbor sum distinguishing index of subcubic graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
- Neighbor sum distinguishing coloring of some graphs
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- Neighbor-sum-distinguishing edge choosability of subcubic graphs
- General neighbour-distinguishing index of a graph
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- scientific article; zbMATH DE number 6712567 (Why is no real title available?)
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- On Neighbor-Distinguishing Index of Planar Graphs
- Neighbor sum distinguishing index
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Neighbor sum distinguishing edge coloring of subcubic graphs
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- On the neighbor sum distinguishing index of planar graphs
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Neighbor sum distinguishing index of 2-degenerate 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)
