Imagen de Portada

Digraph Yama Nim

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Inoue, Hiyu, Kimura, Shun-ichi, Manabe, Hikaru, Suetsugu, Koki, Yamashita, Takahiro, Yoshiwatari, Kanae
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Combinatorial games and the golden ratio on digraphs
por: Abuku, Tomoaki, et al.
Publicado: (2025)

An Amalgamation Nim with Restriction
por: Manabe, Hikaru
Publicado: (2024)

On the Sprague-Grundy values of games with a pass
por: Manabe, Hikaru, et al.
Publicado: (2025)

$\mathcal{L}\mathcal{R}$-Ending partisan rulesets
por: Inazu, Hiroki, et al.
Publicado: (2025)

A Subtraction Nim with a Pass
por: Larsson, Urban, et al.
Publicado: (2026)

Enforce and selective operators of combinatorial games
por: Abuku, Tomoaki, et al.
Publicado: (2023)

Maximum Nim and Josephus Problem algorithm
por: Takahashi, Shoei, et al.
Publicado: (2024)

Maximum Nim and Josephus Problem
por: Takahashi, Shoei, et al.
Publicado: (2024)

What happens when we add impartial loopy games and impartial entailing games?
por: Suetsugu, Koki
Publicado: (2024)

Additive sink subtraction
por: Bhagat, Anjali, et al.
Publicado: (2026)

Extended circular nim
por: Suetsugu, Koki
Publicado: (2025)

Improving upper and lower bounds of the number of games born by day 4
por: Suetsugu, Koki
Publicado: (2022)

Relationship between misère NIM and two-player GOISHI HIROI
por: Abuku, Tomoaki, et al.
Publicado: (2024)

Wythoff's Game with a Pass
por: Miyadera, Ryohei, et al.
Publicado: (2017)

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

Tree and Tripod Nim
por: Hennessey, Aidan
Publicado: (2024)

Scoring Nim
por: Oginuma, Hiromi, et al.
Publicado: (2025)

A Variant of Game of Sliding Coins
por: Miyadera, Ryohei, et al.
Publicado: (2025)

Circular Nim CN(7,4)
por: Dufour, Matthieu, et al.
Publicado: (2021)

Single-delete Nim
por: Shinoda, Masato
Publicado: (2024)

Shrinking Circular Nim
por: Oginuma, Hiromi, et al.
Publicado: (2024)

Additive Subtraction Games
por: Larsson, Urban, et al.
Publicado: (2026)

Impartial and Partizan Restricted Chocolate Bar Games
por: Miyadera, Ryohei, et al.
Publicado: (2023)

The Game of Graph Nim on graphs with four edges
por: Karmakar, Sayar, et al.
Publicado: (2025)

Tree versus tree of preorder induced by rainbow forbidden subgraphs
por: Maezawa, Shun-ichi
Publicado: (2026)

Wythoff's Nim with Finite Alterations
por: Hu, Mirabel, et al.
Publicado: (2024)

Cordiality of Digraphs
por: Beasley, Leroy, et al.
Publicado: (2021)

An NP-hard generalization of Nim
por: Liu, Chunlei
Publicado: (2024)

Słupecki Digraphs
por: Kunos, Ádám, et al.
Publicado: (2024)

Nim on Integer Partitions and Hyperrectangles
por: Gottlieb, Eric, et al.
Publicado: (2025)

Spectra of Corona Products of Digraphs
por: Cavers, Michael, et al.
Publicado: (2025)

The List Linear Arboricity of Digraphs
por: Shi, Yueping, et al.
Publicado: (2025)

Spectra of Subdivision Products of Digraphs
por: Cavers, Michael, et al.
Publicado: (2026)

Arc-disjoint Steiner Cycles in Digraphs
por: Bai, Jie, et al.
Publicado: (2026)

Covering Random Digraphs with Hamilton Cycles
por: Ferber, Asaf, et al.
Publicado: (2024)

Structure of cycles in Minimal Strong Digraphs
por: Argudo, Miguel Arcos, et al.
Publicado: (2024)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
por: Cavallaro, Dario, et al.
Publicado: (2026)

Note on Long Directed Cycles in Eulerian Digraphs
por: Ai, Jiangdong, et al.
Publicado: (2025)

Internally-disjoint Pendant Steiner Trees in Digraphs
por: Yu, Shanshan, et al.
Publicado: (2025)

Colouring Complete Multipartite and Kneser-type Digraphs
por: Harutyunyan, Ararat, et al.
Publicado: (2023)