A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
From MaRDI portal
Publication:3461985
DOI10.1137/120903178zbMath1328.05070OpenAlexW2257828626MaRDI QIDQ3461985
Publication date: 4 January 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120903178
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (11)
Adjacent vertex distinguishing edge coloring of IC-planar graphs ⋮ Strict neighbor-distinguishing index of subcubic graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs ⋮ Local neighbor-distinguishing index of graphs ⋮ Unnamed Item ⋮ Neighbor sum distinguishing index of subcubic graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles ⋮ Some bounds on the neighbor-distinguishing index of graphs ⋮ On the neighbor-distinguishing indices of planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- On the neighbour-distinguishing index of a graph
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent strong edge coloring of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
This page was built for publication: A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
