Pages that link to "Item:Q2715968"
From MaRDI portal
The following pages link to Re-orienting tournaments by pushing vertices. (Q2715968):
Displaying 9 items.
- On reorienting graphs by pushing down maximal vertices (Q1087553) (← links)
- An extremal connectivity parameter of tournaments (Q1587602) (← links)
- Pushing vertices in digraphs without long induced cycles (Q1613399) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
- On oriented cliques with respect to push operation (Q2410221) (← links)
- Acyclically pushable bipartite permutation digraphs: an algorithm (Q2497498) (← links)
- On the pushable chromatic number of various types of grids (Q2686138) (← links)
- Nearly-acyclically pushable tournaments (Q2712519) (← links)