:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Abuku, Tomoaki, Inazu, Hiroki, Inoue, Hiyu, Kimura, Shun-ichi, Suetsugu, Koki, Watanabe, Kosaku, Yamashita, Takahiro
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics
Accès en ligne:	https://arxiv.org/abs/2509.04943
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

$\mathcal{L}\mathcal{R}$-Ending partisan rulesets
par: Inazu, Hiroki, et autres
Publié: (2025)

Enforce and selective operators of combinatorial games
par: Abuku, Tomoaki, et autres
Publié: (2023)

Digraph Yama Nim
par: Inoue, Hiyu, et autres
Publié: (2025)

Relationship between misère NIM and two-player GOISHI HIROI
par: Abuku, Tomoaki, et autres
Publié: (2024)

Cyclic impartial games with carry-on moves
par: Abuku, Tomoaki, et autres
Publié: (2025)

Various Diamond Properties in Combinatorial Game Theory
par: Kusakari, Keiichirou, et autres
Publié: (2025)

What happens when we add impartial loopy games and impartial entailing games?
par: Suetsugu, Koki
Publié: (2024)

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

On the Sprague-Grundy values of games with a pass
par: Manabe, Hikaru, et autres
Publié: (2025)

Extended circular nim
par: Suetsugu, Koki
Publié: (2025)

An analogue of Reed's conjecture for digraphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2024)

On the Adjacency spectra of alternating-oriented $n$-gonal staircase digraphs
par: Minamide, Hiroki
Publié: (2026)

$(Δ-1)$-dicolouring of digraphs
par: Harutyunyan, Ararat, et autres
Publié: (2025)

Tree versus tree of preorder induced by rainbow forbidden subgraphs
par: Maezawa, Shun-ichi
Publié: (2026)

Expansion of a digraph with a doubly bidirectionally connected pair is not cactus
par: Kodama, Hiroki
Publié: (2023)

On Hamiltonian bypasses in digraphs and bipartite digraphs
par: Darbinyan, Samvel Kh.
Publié: (2025)

Distant digraph domination
par: Nguyen, Tung, et autres
Publié: (2024)

Distance ideals of digraphs
par: Alfaro, Carlos A., et autres
Publié: (2024)

Enumeration of dicirculant digraphs
par: Wang, Jing, et autres
Publié: (2024)

Minors of plane digraphs
par: Chudnovsky, Maria, et autres
Publié: (2026)

List packing of graphs with bounded tree-width
par: Kashima, Masaki, et autres
Publié: (2026)

Odd Edge Colorings of Graphs with Odd Order
par: Kano, Mikio, et autres
Publié: (2026)

Preorder induced by rainbow forbidden subgraphs
par: Maezawa, Shun-ichi, et autres
Publié: (2025)

Combinatorial games on Galton-Watson trees involving several-generation-jump moves
par: Podder, Moumanti, et autres
Publié: (2022)

Some inner metric parameters of a digraph: Iterated line digraphs and integer sequences
par: Bong, N. H., et autres
Publié: (2024)

Sample Complexity of Low-rank Tensor Recovery from Uniformly Random Entries
par: Hamaguchi, Hiroki, et autres
Publié: (2024)

Convergence of spectra of digraph limits
par: Grebík, Jan, et autres
Publié: (2025)

Higher diameters of Cayley digraphs
par: Magda, G. C., et autres
Publié: (2025)

On the length of directed paths in digraphs
par: Cheng, Yangyang, et autres
Publié: (2024)

Oriented trees and paths in digraphs
par: Stein, Maya
Publié: (2023)

A note on digraph splitting
par: Christoph, Micha, et autres
Publié: (2023)

Spanning subdivisions in dense digraphs
par: Lee, Hyunwoo
Publié: (2023)

A study on token digraphs
par: Fernandes, Cristina G., et autres
Publié: (2024)

Invertibility of digraphs and tournaments
par: Alon, Noga, et autres
Publié: (2022)

Dominance complexes, neighborhood complexes and combinatorial Alexander duals
par: Matsushita, Takahiro, et autres
Publié: (2023)

On a family of divisible design digraphs
par: Muzychuk, Mikhail, et autres
Publié: (2024)

Sufficient conditions for closed-trailable in digraphs
par: Dong, Changchang, et autres
Publié: (2024)

The 3-dicritical semi-complete digraphs
par: Havet, Frédéric, et autres
Publié: (2024)

On the total Italian domination number in digraphs
par: Dong, Changchang, et autres
Publié: (2024)

Computing the degreewidth of a digraph is hard
par: Aboulker, Pierre, et autres
Publié: (2024)