Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
From MaRDI portal
Publication:987498
DOI10.1007/s10878-008-9178-5zbMath1221.05166OpenAlexW2046587597MaRDI QIDQ987498
Publication date: 13 August 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9178-5
Related Items
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree ⋮ Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor-sum-distinguishing edge choosability of subcubic graphs ⋮ Neighbor sum distinguishing index of planar graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles ⋮ Two-distance vertex-distinguishing index of sparse subcubic graphs ⋮ An improved upper bound for the neighbor sum distinguishing index of graphs ⋮ On the inclusion chromatic index of a graph ⋮ Minimum number of disjoint linear forests covering a planar graph ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ The linear 2-arboricity of sparse graphs ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ \(d\)-strong edge colorings of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs ⋮ Adjacent vertex distinguishing indices of planar graphs without 3-cycles ⋮ Unnamed Item ⋮ Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five ⋮ NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS ⋮ 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}\) ⋮ Unnamed Item ⋮ Distant sum distinguishing index of graphs ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs ⋮ 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 ⋮ Edge colorings of the direct product of two graphs ⋮ Neighbor sum distinguishing edge colorings of sparse graphs
Cites Work
- Unnamed Item
- \(r\)-strong edge colorings of graphs
- Strong edge colorings of graphs
- Adjacent strong edge coloring of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- (d,1)-total labeling of graphs with a given maximum average degree
- Vertex-distinguishing proper edge-colorings
- Vertex-distinguishing edge colorings of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
