$Δ+300$ is a Bound on the Adjacent Vertex Distinguishing Edge Chromatic Number

Simple item page
dc.creatorHatami, Hamed
dc.date2006-12-31
dc.date.accessioned2026-07-07T07:37:56Z
dc.date.available2026-07-07T07:37:56Z
dc.descriptionAn adjacent vertex distinguishing edge-coloring or an \avd-coloring of a simple graph $G$ is a proper edge-coloring of $G$ such that no pair of adjacent vertices meets the same set of colors. We prove that every graph with maximum degree $Δ$ and with no isolated edges has an \avd-coloring with at most $Δ+300$ colors, provided that $Δ>10^{20}$.
dc.identifierhttps://arxiv.org/abs/math/0701012
dc.identifierhttp://arxiv.org/abs/math/0701012
dc.identifierJ. Combin. Theory Ser. B 95(2) (2005) pp. 246-256
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120948
dc.subjectCombinatorics
dc.subject05C15
dc.title$Δ+300$ is a Bound on the Adjacent Vertex Distinguishing Edge Chromatic Number
dc.typetext

Files

Collections

arXiv