1-2-3 Conjecture in digraphs: more results and directions
type: Item
instance of: scholarly article
title: 1-2-3 Conjecture in digraphs: more results and directions
zbMATH Open document ID: 1443.05079
author: Julien Bensmail
author: Kasper Lyngsie
published in: Discrete Applied Mathematics
publication date: 2020-07-07T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7218260
zbMATH Keywords: 1-2-3 Conjecture
zbMATH Keywords: directed variants
zbMATH Keywords: bounds
zbMATH Keywords: complexity
zbMATH Keywords: choosability
Wikidata QID: Q122981069
MaRDI profile type: Publication
full work available at URL: j.dam.2020.03.017
OpenAlex ID: W2972864020
cites work: On a directed variation of the 1-2-3 and 1-2 conjectures
cites work: Weight choosability of graphs
cites work: Q4560260
cites work: An oriented version of the 1-2-3 conjecture
cites work: Coloring chip configurations on graphs and digraphs
cites work: Graphs are \((1, \varDelta + 1)\)-choosable
cites work: Q5403005
cites work: A note on a directed version of the 1-2-3 conjecture
cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
cites work: Edge weights and vertex colours
cites work: Digraphs are 2-weight choosable
cites work: Q4083461
cites work: Q3575472
cites work: The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
DOI: 10.1016/J.DAM.2020.03.017
description: scientific article; zbMATH DE number 7218260