Treewidth versus clique number. V. Further connections with tree-independence number
Fuente:
arXiv
Saved in:
| Main Authors: | Hilaire, Claire, Milanič, Martin, Vasić, Đorđe |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Treewidth versus clique number: induced minors
by: Hilaire, Claire, et al.
Published: (2024)
by: Hilaire, Claire, 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)
by: Dallard, Clément, et al.
Published: (2024)
Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
Induced Minor Models. I. Structural Properties and Algorithmic Consequences
by: Bousquet, Nicolas, et al.
Published: (2024)
by: Bousquet, Nicolas, 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)
by: Dossou-Olory, Audace A. V., et al.
Published: (2026)
Cardinalities of the total number of independent sets
by: Kovács, Benedek, et al.
Published: (2025)
by: Kovács, Benedek, et al.
Published: (2025)
Bicyclic graphs with the smallest and largest numbers of connected sets
by: Dossou-Olory, Audace A. V.
Published: (2026)
by: Dossou-Olory, Audace A. V.
Published: (2026)
On the Treewidth of Token and Johnson Graphs
by: Fabila-Monroy, Ruy, et al.
Published: (2024)
by: Fabila-Monroy, Ruy, et al.
Published: (2024)
Characterizing all $K_4$-free well-edge-dominated graphs of girth 3
by: Anderson, Sarah E., et al.
Published: (2025)
by: Anderson, Sarah E., et al.
Published: (2025)
Characterizing all nonbipartite well-edge-dominated graphs
by: Anderson, Sarah E., et al.
Published: (2026)
by: Anderson, Sarah E., et al.
Published: (2026)
The odd independence number of graphs, I: Foundations and classical classes
by: Caro, Yair, et al.
Published: (2025)
by: Caro, Yair, et al.
Published: (2025)
Graphs with Independent Exact $r$-covers for all $r$
by: Chau, Hou Tin
Published: (2025)
by: Chau, Hou Tin
Published: (2025)
Triangle-free triple systems
by: Frankl, Peter, et al.
Published: (2024)
by: Frankl, Peter, et al.
Published: (2024)
Layered tree-independence number and clique-based separators
by: Dallard, Clément, et al.
Published: (2025)
by: Dallard, Clément, et al.
Published: (2025)
Strengthening Wilf's lower bound on clique number
by: Jadav, Hareshkumar, et al.
Published: (2025)
by: Jadav, Hareshkumar, et al.
Published: (2025)
Distribution of independent sets in perfect $r$-ary trees
by: Iľkovič, Daniel, et al.
Published: (2026)
by: Iľkovič, Daniel, et al.
Published: (2026)
Multiple breaks of log-concavity in the independence polynomials of trees
by: Bautista-Ramos, César
Published: (2025)
by: Bautista-Ramos, César
Published: (2025)
Constructive characterizations concerning total outer-independent domination in subdivision trees
by: Cabrera-Martínez, A., et al.
Published: (2026)
by: Cabrera-Martínez, A., et al.
Published: (2026)
The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)
by: Caro, Yair, et al.
Published: (2025)
Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)
by: Chudnovsky, Maria, et al.
Published: (2025)
Sharp bounds for covering with large cliques and independent sets
by: Bitonti, Veronica, et al.
Published: (2026)
by: Bitonti, Veronica, et al.
Published: (2026)
Neighborhood Balanced 3-Coloring
by: Minyard, Mitchell, et al.
Published: (2024)
by: Minyard, Mitchell, et al.
Published: (2024)
Isospectral Cayley graphs with even and odd spectrum
by: Chiapparoli, Paula M., et al.
Published: (2026)
by: Chiapparoli, Paula M., et al.
Published: (2026)
A structural duality for path-decompositions into parts of small radius
by: Albrechtsen, Sandra, et al.
Published: (2023)
by: Albrechtsen, Sandra, et al.
Published: (2023)
Graph Sensitivity under Join and Decomposition
by: Kriloff, Cathy, et al.
Published: (2025)
by: Kriloff, Cathy, et al.
Published: (2025)
Characterizing Graphs as Algebraic Squares
by: Collins, Karen L., et al.
Published: (2025)
by: Collins, Karen L., et al.
Published: (2025)
Uniform Shared Neighborhood Structures in Edge-Regular Graphs
by: DeLeo, Jared
Published: (2024)
by: DeLeo, Jared
Published: (2024)
Characterization of Well-Totally Dominated Trees
by: Lim, Jounglag, et al.
Published: (2026)
by: Lim, Jounglag, et al.
Published: (2026)
Domination number of modular product graphs
by: Bermudo, Sergio, et al.
Published: (2024)
by: Bermudo, Sergio, et al.
Published: (2024)
Monophonic number of Kneser graphs and strongly 2-monophonic graphs
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
Tree decompositions meet induced matchings: beyond Max Weight Independent Set
by: Lima, Paloma T., et al.
Published: (2024)
by: Lima, Paloma T., et al.
Published: (2024)
Independence numbers of the 2-token graphs of some join graphs
by: Rivera, Luis Manuel, et al.
Published: (2025)
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)
by: Jiménez-Sepúlveda, Paloma, et al.
Published: (2018)
A Tutte-type canonical decomposition of 3- and 4-connected graphs
by: Kurkofka, Jan, et al.
Published: (2025)
by: Kurkofka, Jan, et al.
Published: (2025)
A characterisation of all vertex-transitive finite graphs of connectivity < 5
by: Kurkofka, Jan, et al.
Published: (2026)
by: Kurkofka, Jan, 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)
by: Tout, Omar
Published: (2023)
Spectral approaches for $d$-improper chromatic number
by: Guo, Krystal, et al.
Published: (2024)
by: Guo, Krystal, et al.
Published: (2024)
A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
by: Milanič, Martin, et al.
Published: (2024)
by: Milanič, Martin, et al.
Published: (2024)
Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)
by: Bresar, Bostjan, et al.
Published: (2024)
The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)
by: Milanič, Martin, et al.
Published: (2023)
Similar Items
-
Treewidth versus clique number: induced minors
by: Hilaire, Claire, 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) -
Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025) -
Induced Minor Models. I. Structural Properties and Algorithmic Consequences
by: Bousquet, Nicolas, 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)