On the neighbor-distinguishing indices of planar graphs
From MaRDI portal
Publication:2117565
Recommendations
- Neighbor-distinguishing indices of planar graphs with maximum degree ten
- On Neighbor-Distinguishing Index of Planar Graphs
- Neighbor sum distinguishing index of planar graphs
- On the neighbour-distinguishing index of a graph
- A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
Cites work
- scientific article; zbMATH DE number 6303005 (Why is no real title available?)
- A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
- Adjacent Vertex Distinguishing Edge‐Colorings
- Adjacent strong edge coloring of graphs
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- Edge-partitions of graphs and their neighbor-distinguishing index
- On Neighbor-Distinguishing Index of Planar Graphs
- Progress on the adjacent vertex distinguishing edge coloring conjecture
- Some bounds on the neighbor-distinguishing index of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- r-strong edge colorings of graphs
Cited in
(9)- On Neighbor-Distinguishing Index of Planar Graphs
- Local neighbor-distinguishing index of graphs
- scientific article; zbMATH DE number 6712567 (Why is no real title available?)
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles
- Edge-partitions of graphs and their neighbor-distinguishing index
- Some bounds on the neighbor-distinguishing index of graphs
- Strict neighbor-distinguishing index of subcubic graphs
- Neighbor-distinguishing indices of planar graphs with maximum degree ten
- On the neighbour-distinguishing index of a graph
This page was built for publication: On the neighbor-distinguishing indices of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117565)