Cover Image

On the minimal forts of trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cameron, Thomas R., Li, Kelvin
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C05, 05C15, 05C30, 05C57
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
by: Cameron, Thomas R., et al.
Published: (2025)

Gallai-Ramsey multiplicity for rainbow small trees
by: Li, Xueliang, et al.
Published: (2023)

Principal minors of tree distance matrices
by: Richman, Harry, et al.
Published: (2024)

The Power Contamination Problem on Grids Revisited: Optimality, Combinatorics, and Links to Integer Sequences
by: Mehiri, El-Mehdi, et al.
Published: (2025)

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

Exploring the Influence of Graph Operations on Zero Forcing Sets
by: Menon, Krishna, et al.
Published: (2024)

Hat guessing number and guaranteed subgraphs
by: Bradshaw, Peter
Published: (2021)

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

Long paths need not minimize $H$-colorings among trees
by: Galvin, David, et al.
Published: (2025)

A characterization of always solvable trees in the Lights Out game using the activation types of vertices
by: Batal, Ahmet
Published: (2020)

Enumeration of weighted plane trees by a permutation model
by: Lu, Sicheng, et al.
Published: (2026)

Hoffman-London graphs: When paths minimize $H$-colorings among trees
by: Galvin, David, et al.
Published: (2025)

($\mathfrak{S}_p \times \mathfrak{S}_q$)-Invariant Graphical Parking Functions
by: Snider, Lauren, et al.
Published: (2023)

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

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

On the DP-chromatic Number of Cartesian Products of Critical Graphs
by: Kaul, Hemanshu, et al.
Published: (2025)

DP color functions of hypergraphs
by: Cui, Ruiyi, et al.
Published: (2025)

Algorithms for the Generation of Snarks
by: Brinkmann, Gunnar, et al.
Published: (2026)

On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
by: Halberg, Charlie, et al.
Published: (2020)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
by: Dong, Fengming, et al.
Published: (2022)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
by: Dong, Fengming, et al.
Published: (2023)

Distinguishing Polynomials of Graphs
by: Haghighi, Mohammad Hassan Shirdareh, et al.
Published: (2024)

Counterexamples to two conjectures on mean color numbers of graphs
by: Zhai, Wushuang, et al.
Published: (2024)

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

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

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

A note on plane trees with decreasing labels
by: Cheung, Tsun-Ming, et al.
Published: (2025)

Upper bound for the number of maximal dissociation sets in trees
by: Wang, Ziyuan, et al.
Published: (2024)

The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
by: Ge, Jun, et al.
Published: (2026)

Enumerative Chromatic Choosability
by: Allred, Sarah, et al.
Published: (2025)

Enumeratively Chromatic-Choosable Theta Graphs
by: Chi, Yanghong, et al.
Published: (2026)

On Polynomial Representations of Dual DP Color Functions
by: Mudrock, Jeffrey A., et al.
Published: (2024)

Counting Packings of List-colorings of Graphs
by: Kaul, Hemanshu, et al.
Published: (2024)