Digraphs are 2-weight choosable
From MaRDI portal
Publication:625384
Recommendations
Cited in
(9)- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
- Local antimagic orientations of \(d\)-degenerate graphs
- Deza digraphs. II.
- An oriented version of the 1-2-3 conjecture
- Algorithmic complexity of proper labeling problems
- A solution to the 1-2-3 conjecture
- 1-2-3 Conjecture in digraphs: more results and directions
- Weight choosability of oriented hypergraphs
- On a directed variation of the 1-2-3 and 1-2 conjectures
This page was built for publication: Digraphs are 2-weight choosable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625384)