Feedback Vertex Sets in Tournaments
From MaRDI portal
Publication:4908824
DOI10.1002/jgt.21631zbMath1259.05070arXiv0905.0567OpenAlexW2886475100MaRDI QIDQ4908824
Publication date: 7 March 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.0567
Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20)
Related Items (13)
Enumerating minimal connected dominating sets in graphs of bounded chordality ⋮ On the number of connected sets in bounded degree graphs ⋮ Maximal and maximum dissociation sets in general and triangle-free graphs ⋮ Minimal dominating sets in interval graphs and trees ⋮ Improved bounds for minimal feedback vertex sets in tournaments ⋮ Enumeration and maximum number of minimal connected vertex covers in graphs ⋮ Minimal dominating sets in graph classes: combinatorial bounds and enumeration ⋮ On the Number of Connected Sets in Bounded Degree Graphs ⋮ Computing minimal extending sets by relation-algebraic modeling and development ⋮ Enumerating Minimal Tropical Connected Sets ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles ⋮ Tournaments and Semicomplete Digraphs ⋮ Bounds on the disparity and separation of tournament solutions
Cites Work
- Unnamed Item
- Minimal stable sets in tournaments
- Finding odd cycle transversals.
- Enumerating maximal independent sets with applications to graph colouring.
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Sophisticated voting outcomes and agenda control
- A note on the complexity of the chromatic number problem
- A short proof of a theorem of Reid and Parker on tournaments
- On enumerating all minimal solutions of feedback problems
- Iterative compression and exact algorithms
- Efficient exact algorithms through enumerating maximal independent sets and other techniques
- Open problems around exact algorithms
- Finding Induced Subgraphs via Minimal Triangulations
- Treewidth Computation and Extremal Combinatorics
- Set Partitioning via Inclusion-Exclusion
- Feedback Vertex Sets in Tournaments
- A New Algorithm for Generating All the Maximal Independent Sets
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- On the number of maximal bipartite subgraphs of a graph
- Combinatorial bounds via measure and conquer
- On Independent Sets and Bicliques in Graphs
- Parameterized and Exact Computation
- On Subtournaments of a Tournament
- The Theory of Round Robin Tournaments
- Disproof of a conjecture of Erdös and moser on tournaments
- On maximal transitive subtournaments
- On cliques in graphs
This page was built for publication: Feedback Vertex Sets in Tournaments
