Cover Image

Graphs with Independent Exact $r$-covers for all $r$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Chau, Hou Tin
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C69 (Primary) 05C35, 05C76 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Distribution of independent sets in perfect $r$-ary trees
by: Iľkovič, Daniel, et al.
Published: (2026)

Sharp bounds for covering with large cliques and independent sets
by: Bitonti, Veronica, et al.
Published: (2026)

Triangle-free triple systems
by: Frankl, Peter, et al.
Published: (2024)

Inertia, Independence and Expanders
by: Tang, Quanyu, et al.
Published: (2025)

Treewidth versus clique number. V. Further connections with tree-independence number
by: Hilaire, Claire, et al.
Published: (2025)

Exact double domination in subdivision, Mycielskian and middle graphs
by: Behtoei, Ali, et al.
Published: (2024)

Ratio of the number of $\mathbf{1}$-nearly independent vertex subsets and the Merrifield-Simmons index
by: Dossou-Olory, Audace A. V., et al.
Published: (2026)

Independence numbers of the 2-token graphs of some join graphs
by: Rivera, Luis Manuel, et al.
Published: (2025)

Independence numbers of some double vertex graphs and pair graphs
by: Jiménez-Sepúlveda, Paloma, et al.
Published: (2018)

Cardinalities of the total number of independent sets
by: Kovács, Benedek, et al.
Published: (2025)

The intersection density of cubic arc-transitive graphs with $2$-arc-regular full automorphism group equal to $\operatorname{PGL}_2(q)$
by: Meagher, Karen, et al.
Published: (2025)

Characterizing all nonbipartite well-edge-dominated graphs
by: Anderson, Sarah E., et al.
Published: (2026)

Maximal independent sets in the middle two layers of the Boolean lattice
by: Balogh, József, et al.
Published: (2025)

Characterizing all $K_4$-free well-edge-dominated graphs of girth 3
by: Anderson, Sarah E., et al.
Published: (2025)

Towards the essence of Šoltés' problem
by: Cambie, Stijn
Published: (2024)

On Inversion Graphs of Permutations
by: Mandrick, Sean
Published: (2025)

Hilton-Milner Theorem for the $r$-independent sets in a union of cliques
by: Gunderson, Karen, et al.
Published: (2025)

Co-even Domination Number of a Modified Graph by Operations on a Vertex or an Edge
by: Ghanbari, Nima, et al.
Published: (2021)

Equitable Dominator Coloring of Line Graphs of Some Graphs
by: George, Phebe Sarah, et al.
Published: (2024)

The k-Sudoku Number of Graphs
by: Nair, Manju S, et al.
Published: (2025)

Characterizing Graphs as Algebraic Squares
by: Collins, Karen L., et al.
Published: (2025)

Graph Sensitivity under Join and Decomposition
by: Kriloff, Cathy, et al.
Published: (2025)

Computing the Exchange Number in Graphs with respect to Cycle Convexity
by: Nair, Revathy S., et al.
Published: (2026)

Uniform Shared Neighborhood Structures in Edge-Regular Graphs
by: DeLeo, Jared
Published: (2024)

Number of independent transversals in multipartite graphs
by: Tang, Yantao, et al.
Published: (2025)

Complexity and Structural Results for the Hull and Convexity Numbers in Cycle Convexity for Graph Products
by: Anand, Bijo S., et al.
Published: (2024)

Limits and Periodicity of Metamour $2$-Distance Graphs
by: Erickson, William Q., et al.
Published: (2024)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)

On k-(total) limited packing in graphs
by: Ahmadi, Azam Sadat, et al.
Published: (2024)

The minimum number of vertices and edges of connected graphs with ind-match$(G) = p$, min-match$(G) = q$ and match$(G) = r$
by: Matsuda, Kazunori, et al.
Published: (2025)

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

Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
by: Torres, Pablo
Published: (2025)

$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$
by: Brezovnik, Simon, et al.
Published: (2026)

On the domination number of the cartesian product of the path graph and any pair of graphs
by: Tout, Omar
Published: (2023)

An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
by: Troncoso, E. Acosta, et al.
Published: (2026)

Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)
by: Brezovnik, Simon, et al.
Published: (2026)

Domination number of modular product graphs
by: Bermudo, Sergio, et al.
Published: (2024)

Domination on Vertex-weighted Graphs Induce by a Coloring
by: Garrido-Vizuete, María A., et al.
Published: (2025)

DP-Coloring of Graphs from Random Covers
by: Bernshteyn, Anton, et al.
Published: (2023)

Piercing all maximum cliques in hypergraphs
by: Holmsen, Andreas, et al.
Published: (2026)