Adjacent Vertex Distinguishing Edge‐Colorings
From MaRDI portal
Publication:5454274
DOI10.1137/S0895480102414107zbMath1189.05056MaRDI QIDQ5454274
Richard H. Schelp, Jenő Lehel, Paul N. Balister, Ervin Gyoeri
Publication date: 28 March 2008
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (85)
AVD proper edge-coloring of some families of graphs ⋮ 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 ⋮ Distant set distinguishing total colourings of graphs ⋮ Unnamed Item ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ A note on the neighbour-distinguishing index of digraphs ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ Unnamed Item ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) ⋮ Strict neighbor-distinguishing index of subcubic graphs ⋮ On generalisations of the AVD conjecture to digraphs ⋮ On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) ⋮ Neighbor sum distinguishing index ⋮ On generalized neighbor sum distinguishing index of planar graphs ⋮ Edge-partitions of graphs and their neighbor-distinguishing index ⋮ The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs ⋮ Vertex-distinguishing edge colorings of graphs with degree sum conditions ⋮ On the adjacent vertex-distinguishing equitable edge coloring of graphs ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ Algorithmic complexity of proper labeling problems ⋮ 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 ⋮ Distant set distinguishing edge colourings of graphs ⋮ An improved upper bound for the neighbor sum distinguishing index of graphs ⋮ On the inclusion chromatic index of a graph ⋮ Multiplicative vertex-colouring weightings of graphs ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ 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 ⋮ The adjacent vertex distinguishing total chromatic number ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of 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 ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) ⋮ On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) ⋮ 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 ⋮ General neighbour-distinguishing index of a graph ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ On the adjacent vertex distinguishing edge colourings of graphs ⋮ Neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Unnamed Item ⋮ General neighbour-distinguishing index via chromatic number ⋮ Distant sum distinguishing index of graphs ⋮ Neighbor sum distinguishing index of subcubic graphs ⋮ Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree ⋮ Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs ⋮ 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 ⋮ Edge weights and vertex colours ⋮ On Neighbor-Distinguishing Index of Planar Graphs ⋮ Adjacent strong edge colorings and total colorings of regular graphs ⋮ Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs ⋮ A new type of edge-derived vertex coloring ⋮ \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles ⋮ From edge-coloring to strong edge-coloring ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs ⋮ On neighbour-distinguishing colourings from lists ⋮ Some bounds on the neighbor-distinguishing index of graphs ⋮ Not necessarily proper total colourings which are adjacent vertex distinguishing ⋮ 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
This page was built for publication: Adjacent Vertex Distinguishing Edge‐Colorings
