Imagen de Portada

Hat guessing number and guaranteed subgraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Bradshaw, Peter
Formato:	Preprint
Publicado:	2021
Materias:	Combinatorics 05C15, 05C57
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the hat guessing number of a planar graph class
por: Bradshaw, Peter
Publicado: (2021)

Cops and robbers on directed and undirected abelian Cayley graphs
por: Bradshaw, Peter, et al.
Publicado: (2019)

Chromatic number and regular subgraphs
por: Janzer, Barnabás, et al.
Publicado: (2024)

Throttling for standard zero forcing on directed graphs
por: Cairncross, Emily, et al.
Publicado: (2020)

On the minimal forts of trees
por: Cameron, Thomas R., et al.
Publicado: (2025)

A lower bound on the number of edges in DP-critical graphs
por: Bradshaw, Peter, et al.
Publicado: (2024)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
por: Bradshaw, Peter, et al.
Publicado: (2024)

On the forts and related parameters of the hypercube graph
por: Brimkov, Boris, et al.
Publicado: (2025)

Connected forcing density and related problems
por: Brimkov, Boris, et al.
Publicado: (2025)

Labeled Chip-Firing on Undirected $k$-ary Trees
por: Inagaki, Ryota, et al.
Publicado: (2025)

Twist polynomial as a weight system for set systems
por: Deng, Qingying, et al.
Publicado: (2024)

A note on monotonicity in Maker-Breaker graph colouring games
por: Hollom, Lawrence
Publicado: (2023)

Maximum odd induced subgraph of a graph concerning its chromatic number
por: Wang, Tao, et al.
Publicado: (2022)

Cubic torus obstructions of small Betti number
por: Kramer, Marie
Publicado: (2025)

Guarding isometric subgraphs and Cops and Robber in planar graphs
por: de la Maza, Sebastián González Hermosillo, et al.
Publicado: (2024)

Crossing number of graphs and $\mathsf{ΔY}$-move
por: Huh, Youngsik, et al.
Publicado: (2024)

The radius capture number
por: Dravec, Tanja, et al.
Publicado: (2025)

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

On Chip-Firing on Undirected Binary Trees
por: Inagaki, Ryota, et al.
Publicado: (2024)

Cop number of partial cubes
por: Crawford, Nicholas, et al.
Publicado: (2025)

Extending graph total colorings to cell complexes
por: Dejter, Italo J.
Publicado: (2026)

The domatic number game played on graphs
por: Hartnell, Bert L., et al.
Publicado: (2025)

Permutation-based Strategies for Labeled Chip-Firing on $k$-ary Trees
por: Inagaki, Ryota, et al.
Publicado: (2025)

Chip Firing on Directed $k$-ary Trees
por: Inagaki, Ryota, et al.
Publicado: (2024)

A new way to prove configuration reducibility using gauge theory
por: Baldridge, Scott, et al.
Publicado: (2024)

Quantum state systems that count perfect matchings
por: Baldridge, Scott, et al.
Publicado: (2024)

Properties of leveled spatial graphs
por: Barthel, Senja, et al.
Publicado: (2024)

Counting subgraphs of coloring graphs
por: Asgarli, Shamil, et al.
Publicado: (2024)

Flexible DP 3-coloring of sparse multigraphs
por: Bradshaw, Peter, et al.
Publicado: (2025)

On the number of minimal forts of a graph
por: Becker, Paul, et al.
Publicado: (2024)

Upper Embeddability of Graphs and Products of Transpositions Associated with Edges
por: Tsujie, Shuhei, et al.
Publicado: (2022)

Faces in girth-saturated graphs on surfaces
por: Axenovich, Maria, et al.
Publicado: (2024)

A new view of hypercube genus
por: Hammack, Richard H., et al.
Publicado: (2023)

Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs
por: Bresar, Bostjan, et al.
Publicado: (2025)

Partial Petrial Polynomials of Ribbon Graphs
por: Yu, Xiaoxiang, et al.
Publicado: (2026)

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

Characterizing circle graphs with binomial partial Petrial polynomials
por: Feng, Ruiqing, et al.
Publicado: (2025)

Partial Petrial polynomials for complete graphs and paths
por: Yan, Qi, et al.
Publicado: (2025)

On the pebbling numbers of Flower, Blanuša, and Watkins snarks
por: Adauto, Matheus, et al.
Publicado: (2023)

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