Cover Image

Partition games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dailly, Antoine, Duchene, Eric, Larsson, Urban, Paris, Gabrielle
Format:	Preprint
Published:	2018
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

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

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

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
by: Dailly, Antoine, et al.
Published: (2018)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

On the balanceability of some graph classes
by: Dailly, Antoine, et al.
Published: (2020)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)

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

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Partition strategies for the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2024)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

Variants of Wythoff game with terminal positions or blocking maneuvers
by: Renard, Antoine, et al.
Published: (2025)

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

Positional s-of-k games
by: Duchêne, Eric, et al.
Published: (2026)

Additive sink subtraction
by: Bhagat, Anjali, et al.
Published: (2026)

Token positional games
by: Bagan, Guillaume, et al.
Published: (2026)

Generalized saturation game
by: Patkós, Balázs, et al.
Published: (2024)

The one-visibility Localization game
by: Bonato, Anthony, et al.
Published: (2023)

Counting the Number of Domatic Partition of a Graph
by: Alikhani, Saeid, et al.
Published: (2024)

Word-Representability of Well-Partitioned Chordal Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Exact Biclique Partition number of Split Graphs
by: Babu, Anand, et al.
Published: (2025)

Reconsideration of Tangle and Ultrafilter using Separation and Partition
by: Fujita, Takaaki
Published: (2023)

A unified convention for achievement positional games
by: Galliot, Florian, et al.
Published: (2025)

The Avoider-Enforcer game on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2025)

Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
by: Dumitrescu, Adrian, et al.
Published: (2024)

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

Resolving Sets in Temporal Graphs
by: Bok, Jan, et al.
Published: (2024)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)

On Iiro Honkala's contributions to identifying codes
by: Hudry, Olivier, et al.
Published: (2024)

The Non-Cancelling Intersections Conjecture
by: Amarilli, Antoine, et al.
Published: (2024)

Homomorphisms of (n,m)-graphs with respect to generalised switch
by: Sen, Sagnik, et al.
Published: (2022)

Bounded degree QBF and positional games
by: Oijid, Nacim
Published: (2024)

On the complexity of the Maker-Breaker happy vertex game
by: Hilaire, Mathieu, et al.
Published: (2026)

On the parameterized complexity of the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2026)

Maker-Maker games of rank 4 are PSPACE-complete
by: Galliot, Florian, et al.
Published: (2025)

Row Impartial Terminus
by: Gottlieb, Eric, et al.
Published: (2025)

Complexity results for a cops and robber game on directed graphs
by: Ben-Ameur, Walid, et al.
Published: (2024)