Pages that link to "Item:Q5917590"
From MaRDI portal
The following pages link to The complexity of arc-colorings for directed hypergraphs (Q5917590):
Displaying 6 items.
- Flow hypergraph reducibility (Q643016) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Flow Hypergraph Reducibility (Q3503561) (← links)
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (Q3569078) (← links)
- α-Derivable digraphs and its application in wireless sensor networking (Q4965899) (← links)
- Coloring directed hypergraphs (Q6098101) (← links)