Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture

DOI10.1137/18M1200427zbMath1453.05036arXiv1804.06104OpenAlexW3097192643WikidataQ123249768 ScholiaQ123249768MaRDI QIDQ5138970

William Lochet, Gwenaël Joret

Publication date: 4 December 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.06104

zbMATH Keywords

local lemmaentropy compressionAVD edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (6)

The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs ⋮ On the inclusion chromatic index of a graph ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs ⋮ Local neighbor-distinguishing index of graphs ⋮ On the neighbor-distinguishing indices of planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing index
• Nonrepetitive colouring via entropy compression
• Adjacent strong edge coloring of graphs
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Asymptotically good list-colorings
• The local cut lemma
• Acyclic edge-coloring using entropy compression
• Neighbour-distinguishing edge colourings of random regular graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• A constructive proof of the general lovász local lemma
• Near-optimal list colorings
• New approach to nonrepetitive sequences
• On the Neighbor Sum Distinguishing Index of Planar Graphs
• Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
• Nonrepetitive Choice Number of Trees
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs

This page was built for publication: Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture