Cover Image

Row Impartial Terminus

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gottlieb, Eric, Khatana, Dawood, Krnc, Matjaž, Muršič, Peter, Qureshi, Ismael
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Impartial Chess on Integer Partitions
by: Gottlieb, Eric, et al.
Published: (2025)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

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

Growing Trees and Amoebas' Replications
by: Gurvich, Vladimir, et al.
Published: (2024)

Avoidability beyond paths
by: Gurvich, Vladimir, et al.
Published: (2022)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
by: Beisegel, Jesse, et al.
Published: (2025)

Enumeration of Row-Column Designs
by: Jäger, Gerold, et al.
Published: (2024)

Dominated balanced separators in wheel-induced-minor-free graphs
by: Chudnovsky, Maria, et al.
Published: (2025)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
by: Beisegel, Jesse, et al.
Published: (2024)

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

Partition games
by: Dailly, Antoine, et al.
Published: (2018)

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

The Hajnal--Rothschild problem
by: Frankl, Peter, et al.
Published: (2025)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

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

The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)

Toward Vu's conjecture
by: Bradshaw, Peter, et al.
Published: (2025)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

Throttling for metric dimension and its variants
by: Brimkov, Boris, et al.
Published: (2025)

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

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)

Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)

Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)

Progress on Self Identifying Codes
by: Jean, Devin, et al.
Published: (2025)

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

Accelerated Cops and Robbers
by: Kinnersley, William B., et al.
Published: (2025)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)

4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)

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

String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025)

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

On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)

Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)

On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)

What is and is not inside a Cayley graph?
by: Knauer, Kolja, et al.
Published: (2025)

How to see the forest for the trees
by: Bérczi-Kovács, Erika, et al.
Published: (2025)

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

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)