Cover Image

On treewidth and maximum cliques

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chudnovsky, Maria, Trotignon, Nicolas
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C75, 05C85, 05C69 G.2.2; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
by: Chudnovsky, Maria, et al.
Published: (2024)

(Even hole, triangle)-free graphs revisited
by: Martins, Beatriz, et al.
Published: (2026)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

Finding irrelevant vertices in linear time on bounded-genus graphs
by: Golovach, Petr A., et al.
Published: (2019)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

Vertex identification to a forest
by: Morelle, Laure, et al.
Published: (2024)

Faster parameterized algorithms for modification problems to minor-closed classes
by: Morelle, Laure, et al.
Published: (2022)

Independent Locating-Dominating Sets in Pseudotrees
by: Cáceres, José, et al.
Published: (2026)

Dynamic programming on bipartite tree decompositions
by: Jaffke, Lars, et al.
Published: (2023)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
by: Morelle, Laure, et al.
Published: (2025)

Compact Representation of Semilinear and Terrain-like Graphs
by: Cardinal, Jean, et al.
Published: (2025)

Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
by: Gartland, Peter, et al.
Published: (2023)

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)

A note on locating-dominating sets in twin-free graphs
by: Bousquet, Nicolas, et al.
Published: (2024)

Calculating the maximum number of maximum cliques for simple graphs
by: Pfeifer, Dániel
Published: (2023)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Separating Matchings in Cubic Graphs
by: Gutiérrez, Juan, et al.
Published: (2026)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
by: Sau, Ignasi, et al.
Published: (2024)

An Overview of Universal Obstructions for Graph Parameters
by: Paul, Christophe, et al.
Published: (2023)

Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)

Graphs with core(G) = nucleus(G)
by: Levit, Vadim E., et al.
Published: (2026)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
by: Sau, Ignasi, et al.
Published: (2026)

On Strict Brambles
by: Lardas, Emmanouil, et al.
Published: (2022)

On non-planar, cycle-conformal graphs
by: Gorsky, Maximilian, et al.
Published: (2026)

Expanded-clique graphs and the domination problem
by: Dourado, Mitre C., et al.
Published: (2022)

Identification to Subclasses of Chordal Graphs
by: Golovach, Petr A., et al.
Published: (2026)

A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)

Every Graph is Essential to Large Treewidth
by: Alecu, Bogdan, et al.
Published: (2025)

Excluding Pinched Spheres
by: Morelle, Laure, et al.
Published: (2025)

Perfect codes in Cayley graphs of Hajós groups
by: Hafidh, Yusuf, et al.
Published: (2025)

The Directed Disjoint Paths Problem with Congestion
by: Bentert, Matthias, et al.
Published: (2025)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
by: Masařík, Tomáš, et al.
Published: (2026)

Excluding a Forest Induced Minor
by: Bonnet, Édouard, et al.
Published: (2025)

Burling graphs revisited, part II: Structure
by: Pournajafi, Pegah, et al.
Published: (2021)

Notes on embedding trees in graphs with O(|T|)-sized covers
by: Pokrovskiy, Alexey
Published: (2024)

A New Temporal Interpretation of Cluster Editing
by: Bocci, Cristiano, et al.
Published: (2022)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
by: Paul, Christophe, et al.
Published: (2024)