Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
Fuente:
arXiv
Saved in:
| Main Authors: | Spirkl, Sophie, Xing, Yun |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)
by: Crew, Logan, et al.
Published: (2026)
Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026)
by: Groenland, Carla, et al.
Published: (2026)
Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
by: Shook, James M., et al.
Published: (2025)
by: Shook, James M., et al.
Published: (2025)
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)
by: Lozin, Vadim, et al.
Published: (2022)
The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)
by: Cameron, Kathie, et al.
Published: (2024)
Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
Forbidden Patterns in Mixed Linear Layouts
by: Haun, Deborah, et al.
Published: (2024)
by: Haun, Deborah, et al.
Published: (2024)
$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)
by: la Tour, Max Dupré, et al.
Published: (2024)
Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
by: Gutin, Gregory, et al.
Published: (2025)
by: Gutin, Gregory, et al.
Published: (2025)
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
by: Ai, Jiangdong, et al.
Published: (2024)
by: Ai, Jiangdong, et al.
Published: (2024)
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Vertex Ranking of Degenerate Graphs
by: Iacono, John, et al.
Published: (2024)
by: Iacono, John, et al.
Published: (2024)
Vertex-Based Localization of Turán's Theorem
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)
by: Pandey, Arti, et al.
Published: (2025)
Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)
by: Beaton, Iain, et al.
Published: (2024)
Tree Independence Number IV. Even-hole-free Graphs
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
On the Identity and Group Problems for Complex Heisenberg Matrices
by: Bell, Paul C., et al.
Published: (2023)
by: Bell, Paul C., et al.
Published: (2023)
Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)
by: Palagiri, V. S. R., et al.
Published: (2024)
Gathering Information about a Graph by Counting Walks from a Single Vertex
by: Fuhlbrück, Frank, et al.
Published: (2024)
by: Fuhlbrück, Frank, et al.
Published: (2024)
Transducing Linear Decompositions of Tournaments
by: Geniet, Colin, et al.
Published: (2026)
by: Geniet, Colin, et al.
Published: (2026)
On Sets of Monochromatic Objects in Bicolored Point Sets
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Connected Dominating Sets in Triangulations
by: Bose, Prosenjit, et al.
Published: (2023)
by: Bose, Prosenjit, et al.
Published: (2023)
Maximal Independent Sets in Planar Triangulations
by: Francis, P., et al.
Published: (2024)
by: Francis, P., et al.
Published: (2024)
Bond Polytope under Vertex- and Edge-sums
by: Kolman, Petr, et al.
Published: (2026)
by: Kolman, Petr, et al.
Published: (2026)
Optimizing alphabet reduction pairs of arrays
by: Culus, Jean-François, et al.
Published: (2024)
by: Culus, Jean-François, et al.
Published: (2024)
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)
by: Jäger, Gerold, et al.
Published: (2019)
Face-hitting Dominating Sets in Planar Graphs
by: Francis, P., et al.
Published: (2024)
by: Francis, P., et al.
Published: (2024)
The Bottleneck Birthday Problem
by: Tripathy, Chijul B.
Published: (2025)
by: Tripathy, Chijul B.
Published: (2025)
On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)
by: Frasser, Carlos E.
Published: (2024)
The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
by: Sun, Yali, et al.
Published: (2024)
by: Sun, Yali, et al.
Published: (2024)
Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
by: Chen, Yeyuan
Published: (2024)
by: Chen, Yeyuan
Published: (2024)
Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
by: Eze, L. C., et al.
Published: (2025)
by: Eze, L. C., et al.
Published: (2025)
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
by: Dumitrescu, Adrian, et al.
Published: (2024)
by: Dumitrescu, Adrian, et al.
Published: (2024)
Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2021)
by: Dubinsky, Manuel, et al.
Published: (2021)
A Note on the Complexity of Graph Recoloring
by: Bousquet, Nicolas
Published: (2024)
by: Bousquet, Nicolas
Published: (2024)
Similar Items
-
Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026) -
Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026) -
Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
by: Shook, James M., et al.
Published: (2025) -
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022) -
The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)