Cover Image

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hatzel, Meike, Schröder, Johannes
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Directed treewidth is closed under taking butterfly minors
by: Kim, Gunwoo, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Erdős-Pósa property of tripods in directed graphs
by: Briański, Marcin, et al.
Published: (2024)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
by: Hatzel, Meike, et al.
Published: (2026)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)

Characterizing and Transforming DAGs within the I-LCA Framework
by: Hellmuth, Marc, et al.
Published: (2024)

Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
by: Lindeberg, Anna, et al.
Published: (2025)

Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
by: Davies, James, et al.
Published: (2025)

Braces of Perfect Matching Width 2
by: Giannopoulou, Archontia C., et al.
Published: (2019)

Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
by: Lindeberg, Anna, et al.
Published: (2024)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
by: Weiß, Meike, et al.
Published: (2025)

On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
by: Weiß, Meike, et al.
Published: (2026)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)

The Normal Play of the Domination Game
by: Brito, João Marcos, et al.
Published: (2025)

The Closed Geodetic Game: algorithms and strategies
by: Dailly, Antoine, et al.
Published: (2024)

The Normal Domination Partizan Game in Stars
by: Sampaio, Rudini, et al.
Published: (2026)

Connected Subtraction Games on Subdivided Stars
by: Dailly, Antoine, et al.
Published: (2018)

Geometric Variants of the Gale--Berlekamp Switching Game
by: Dumitrescu, Adrian
Published: (2024)

The Graph Coloring Game on $4\times n$-Grids
by: Brosse, Caroline, et al.
Published: (2024)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

Fast and Furious: A study on Monotonicity and Speed in Cops-and-Robber Games
by: Fluck, Eva, et al.
Published: (2025)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
by: Hatzel, Meike, et al.
Published: (2024)

Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

Computer-assisted graph theory: a survey
by: Jooken, Jorik
Published: (2025)

Computing fixed point free automorphisms of graphs
by: Abiad, Aida, et al.
Published: (2026)

Computing random $r$-orthogonal Latin squares
by: Bereg, Sergey
Published: (2023)

Computational and Combinatorial Results on Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2026)

Gathering Information about a Graph by Counting Walks from a Single Vertex
by: Fuhlbrück, Frank, et al.
Published: (2024)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
by: Chudnovsky, Maria, et al.
Published: (2024)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
by: Eze, L. C., et al.
Published: (2025)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
by: Bafna, Mehul, et al.
Published: (2025)

Counterexample to Babai's lonely colour conjecture
by: Davies, James, et al.
Published: (2024)

Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)