\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
From MaRDI portal
Publication:2573644
DOI10.1016/j.jctb.2005.04.002zbMath1075.05034arXivmath/0701012OpenAlexW2055120783MaRDI QIDQ2573644
Publication date: 22 November 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0701012
Related Items (75)
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 ⋮ Distant set distinguishing total colourings of graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ 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 ⋮ On the neighbour-distinguishing index of a graph ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ \(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ Strict neighbor-distinguishing index of subcubic graphs ⋮ Neighbor sum 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 ⋮ 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 ⋮ 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 ⋮ On the adjacent vertex-distinguishing acyclic edge coloring of some 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 ⋮ 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 ⋮ 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 ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ 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 ⋮ Acyclic coloring of graphs and entropy compression method ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ On Neighbor-Distinguishing Index of Planar Graphs ⋮ Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs ⋮ A new type of edge-derived vertex coloring ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs ⋮ 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
Cites Work
- \(r\)-strong edge colorings of graphs
- Strong edge colorings of graphs
- Asymptotic behaviour of the observability of \(Q_ n\)
- Adjacent strong edge coloring of graphs
- Edge weights and vertex colours
- Vertex-distinguishing proper edge-colorings
- Vertex-distinguishing edge colorings of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- Graph colouring and the probabilistic method
This page was built for publication: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
