Pages that link to "Item:Q5642582"
From MaRDI portal
The following pages link to On maximal transitive subtournaments (Q5642582):
Displaying 8 items.
- Bounding the feedback vertex number of digraphs in terms of vertex degrees (Q534359) (← links)
- Upper bounds on the size of transitive subtournaments in digraphs (Q2013188) (← links)
- New bounds on the Ramsey number \(r ( I_m , L_n )\) (Q2222964) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)