Image de couverture de livre

Hat guessing number and guaranteed subgraphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Bradshaw, Peter
Format:	Preprint
Publié:	2021
Sujets:	Combinatorics 05C15, 05C57
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the hat guessing number of a planar graph class
par: Bradshaw, Peter
Publié: (2021)

Cops and robbers on directed and undirected abelian Cayley graphs
par: Bradshaw, Peter, et autres
Publié: (2019)

Chromatic number and regular subgraphs
par: Janzer, Barnabás, et autres
Publié: (2024)

Throttling for standard zero forcing on directed graphs
par: Cairncross, Emily, et autres
Publié: (2020)

On the minimal forts of trees
par: Cameron, Thomas R., et autres
Publié: (2025)

A lower bound on the number of edges in DP-critical graphs
par: Bradshaw, Peter, et autres
Publié: (2024)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
par: Bradshaw, Peter, et autres
Publié: (2024)

On the forts and related parameters of the hypercube graph
par: Brimkov, Boris, et autres
Publié: (2025)

Connected forcing density and related problems
par: Brimkov, Boris, et autres
Publié: (2025)

Labeled Chip-Firing on Undirected $k$-ary Trees
par: Inagaki, Ryota, et autres
Publié: (2025)

Twist polynomial as a weight system for set systems
par: Deng, Qingying, et autres
Publié: (2024)

A note on monotonicity in Maker-Breaker graph colouring games
par: Hollom, Lawrence
Publié: (2023)

Maximum odd induced subgraph of a graph concerning its chromatic number
par: Wang, Tao, et autres
Publié: (2022)

Cubic torus obstructions of small Betti number
par: Kramer, Marie
Publié: (2025)

Guarding isometric subgraphs and Cops and Robber in planar graphs
par: de la Maza, Sebastián González Hermosillo, et autres
Publié: (2024)

Crossing number of graphs and $\mathsf{ΔY}$-move
par: Huh, Youngsik, et autres
Publié: (2024)

The radius capture number
par: Dravec, Tanja, et autres
Publié: (2025)

The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
par: Ning, Jiajun, et autres
Publié: (2025)

On Chip-Firing on Undirected Binary Trees
par: Inagaki, Ryota, et autres
Publié: (2024)

Cop number of partial cubes
par: Crawford, Nicholas, et autres
Publié: (2025)

Extending graph total colorings to cell complexes
par: Dejter, Italo J.
Publié: (2026)

The domatic number game played on graphs
par: Hartnell, Bert L., et autres
Publié: (2025)

Permutation-based Strategies for Labeled Chip-Firing on $k$-ary Trees
par: Inagaki, Ryota, et autres
Publié: (2025)

Chip Firing on Directed $k$-ary Trees
par: Inagaki, Ryota, et autres
Publié: (2024)

A new way to prove configuration reducibility using gauge theory
par: Baldridge, Scott, et autres
Publié: (2024)

Quantum state systems that count perfect matchings
par: Baldridge, Scott, et autres
Publié: (2024)

Properties of leveled spatial graphs
par: Barthel, Senja, et autres
Publié: (2024)

Counting subgraphs of coloring graphs
par: Asgarli, Shamil, et autres
Publié: (2024)

Flexible DP 3-coloring of sparse multigraphs
par: Bradshaw, Peter, et autres
Publié: (2025)

On the number of minimal forts of a graph
par: Becker, Paul, et autres
Publié: (2024)

Upper Embeddability of Graphs and Products of Transpositions Associated with Edges
par: Tsujie, Shuhei, et autres
Publié: (2022)

Faces in girth-saturated graphs on surfaces
par: Axenovich, Maria, et autres
Publié: (2024)

A new view of hypercube genus
par: Hammack, Richard H., et autres
Publié: (2023)

Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs
par: Bresar, Bostjan, et autres
Publié: (2025)

Partial Petrial Polynomials of Ribbon Graphs
par: Yu, Xiaoxiang, et autres
Publié: (2026)

Enumeration of plane triangulations with all vertices of degree $3$ or $6$ and a new characterization of akempic triangulations
par: Florek, Jan
Publié: (2025)

Characterizing circle graphs with binomial partial Petrial polynomials
par: Feng, Ruiqing, et autres
Publié: (2025)

Partial Petrial polynomials for complete graphs and paths
par: Yan, Qi, et autres
Publié: (2025)

On the pebbling numbers of Flower, Blanuša, and Watkins snarks
par: Adauto, Matheus, et autres
Publié: (2023)

Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
par: Polavarapu, Achintya Raya
Publié: (2026)