Pages that link to "Item:Q5899364"
From MaRDI portal
The following pages link to The complexity of arc-colorings for directed hypergraphs (Q5899364):
Displaying 4 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (Q3569078) (← links)
- The complexity of arc-colorings for directed hypergraphs (Q5899364) (← links)