Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number

DOI10.1002/rsa.20813zbMath1417.05072arXiv1705.01637OpenAlexW3099819576MaRDI QIDQ5229341

Jakub Kwaśny, Jakub Przybyło

Publication date: 14 August 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

adjacent vertex distinguishing total coloringadjacent vertex distinguishing edge coloringadjacent vertex distinguishing edge choice numberlist neighbor set distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ On the inclusion chromatic index of a graph ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Inclusion total chromatic number

This page was built for publication: Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number