1-2-3 Conjecture in digraphs: more results and directions
From MaRDI portal
Publication:777370
Recommendations
Cites work
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- A note on a directed version of the 1-2-3 conjecture
- An oriented version of the 1-2-3 conjecture
- Coloring chip configurations on graphs and digraphs
- Digraphs are 2-weight choosable
- Edge weights and vertex colours
- Graphs are \((1, \varDelta + 1)\)-choosable
- On a \(1,2\) conjecture
- On a directed variation of the 1-2-3 and 1-2 conjectures
- On locally irregular decompositions and the 1-2 conjecture in digraphs
- On the complexity of vertex-coloring edge-weightings
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Weight choosability of graphs
Cited in
(8)- A note on a directed version of the 1-2-3 conjecture
- Adding direction constraints to the 1-2-3 conjecture
- On locally irregular decompositions and the 1-2 conjecture in digraphs
- On generalisations of the AVD conjecture to digraphs
- The 1‐2‐3‐conjecture holds for dense graphs
- On a directed variation of the 1-2-3 and 1-2 conjectures
- An oriented version of the 1-2-3 conjecture
- A conjecture on 3-anti-quasi-transitive digraphs
This page was built for publication: 1-2-3 Conjecture in digraphs: more results and directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777370)