Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
From MaRDI portal
Publication:358639
DOI10.1007/S10878-011-9444-9zbMath1276.90079OpenAlexW2156842373MaRDI QIDQ358639
Hervé Hocquard, Mickaël Montassier
Publication date: 9 August 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9444-9
Related Items (24)
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles ⋮ On the inclusion chromatic index of a graph ⋮ Neighbor sum distinguishing index of sparse 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 ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Adjacent vertex distinguishing indices of planar graphs without 3-cycles ⋮ Unnamed Item ⋮ Adjacent vertex distinguishing colorings by sum of sparse graphs ⋮ Graphs with multiplicative vertex-coloring 2-edge-weightings ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ Distant sum distinguishing index of graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs ⋮ Inclusion total chromatic number ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ On Neighbor-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
Cites Work
- Unnamed Item
- Unnamed Item
- \(r\)-strong edge colorings of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Strong edge colorings of graphs
- Asymptotic behaviour of the observability of \(Q_ n\)
- Adjacent strong edge coloring of graphs
- The observability of the Fibonacci and the Lucas cubes
- Vertex-distinguishing proper edge-colorings
- Vertex-distinguishing edge colorings of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
This page was built for publication: Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
