On Neighbor-Distinguishing Index of Planar Graphs
From MaRDI portal
Publication:5495886
DOI10.1002/jgt.21764zbMath1296.05072OpenAlexW1515432055MaRDI QIDQ5495886
Mirko Horňák, Danjun Huang, Wei Fan Wang
Publication date: 7 August 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21764
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ Adjacent vertex distinguishing edge coloring of IC-planar graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ Strict neighbor-distinguishing index of subcubic graphs ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ On the inclusion chromatic index of a graph ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ Local neighbor-distinguishing index of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Adjacent vertex distinguishing indices of planar graphs without 3-cycles ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ Neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Distant sum distinguishing index of graphs ⋮ Neighbor sum distinguishing index of subcubic graphs ⋮ Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles ⋮ Some bounds on the neighbor-distinguishing index of graphs ⋮ Edge colorings of the direct product of two graphs ⋮ Neighbor sum distinguishing edge colorings of sparse graphs ⋮ On the neighbor-distinguishing indices of planar graphs
Cites Work
- 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
- Neighbour-distinguishing edge colourings of random regular graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- Unnamed Item
- Unnamed Item
