Imagen de Portada

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Burke, Kyle, Dailly, Antoine, Oijid, Nacim
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Misère Partizan Arc Kayles is PSPACE-complete, even on Planar Graphs
por: Burke, Kyle, et al.
Publicado: (2025)

Bounded degree QBF and positional games
por: Oijid, Nacim
Publicado: (2024)

Exact number of flips required to sort a burnt stack of pancakes
por: Jäger, Gerold, et al.
Publicado: (2026)

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

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

Token positional games
por: Bagan, Guillaume, et al.
Publicado: (2026)

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

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

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

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

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

Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
por: Gutin, Gregory, et al.
Publicado: (2025)

Graph Irregularity via Edge Deletions
por: Bensmail, Julien, et al.
Publicado: (2025)

Reconstructing graphs with subgraph compositions
por: Dailly, Antoine, et al.
Publicado: (2025)

A two-player version of the assignment problem
por: Galliot, Florian, et al.
Publicado: (2026)

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

Partition games
por: Dailly, Antoine, et al.
Publicado: (2018)

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

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

Fast winning strategies for the attacker in eternal domination
por: Bagan, Guillaume, et al.
Publicado: (2024)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
por: Marcille, Clara, et al.
Publicado: (2026)

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

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

Poset Positional Games
por: Bagan, Guillaume, et al.
Publicado: (2024)

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

Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces
por: Brucker, Francois, et al.
Publicado: (2024)

Resolving Sets in Temporal Graphs
por: Bok, Jan, et al.
Publicado: (2024)

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

Karp's patching algorithm on dense digraph
por: Frieze, Alan
Publicado: (2025)

Fast algorithm for $S$-packing coloring of Halin graphs
por: Zhang, Xin, et al.
Publicado: (2025)

Faster 3-colouring algorithm for graphs of diameter 3
por: Groenland, Carla, et al.
Publicado: (2026)

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

A verified implementation of the Misra and Gries edge coloring algorithm
por: Bhoja, Arohee
Publicado: (2025)

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
por: Sawada, Joe, et al.
Publicado: (2025)

A Note on the Complexity of Graph Recoloring
por: Bousquet, Nicolas
Publicado: (2024)

Node-Kayles on Trees
por: Songsuwan, Nuttanon
Publicado: (2025)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

On the Identity and Group Problems for Complex Heisenberg Matrices
por: Bell, Paul C., et al.
Publicado: (2023)

Non-dissective coverings by planks
por: Kupavskii, Andrey, et al.
Publicado: (2025)