The following pages link to Digraphs are 2-weight choosable (Q625384):
Displaying 8 items.
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- On a directed variation of the 1-2-3 and 1-2 conjectures (Q516801) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
- Local antimagic orientations of \(d\)-degenerate graphs (Q1730236) (← links)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- Weight choosability of oriented hypergraphs (Q5225027) (← links)
- A solution to the 1-2-3 conjecture (Q6196158) (← links)