Pages that link to "Item:Q4908824"
From MaRDI portal
The following pages link to Feedback Vertex Sets in Tournaments (Q4908824):
Displaying 13 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- On the Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
