Cover Image

Every Graph is Essential to Large Treewidth

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alecu, Bogdan, Bonnet, Édouard, Villafana, Pedro Bureo, Trotignon, Nicolas
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics 05C75 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Graphs without a 3-connected subgraph are 4-colorable
by: Bonnet, Édouard, et al.
Published: (2024)

Sparse Induced Subgraphs of Large Treewidth
by: Bonnet, Édouard
Published: (2024)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
by: Bonnet, Édouard, et al.
Published: (2023)

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

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

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

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

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

Computing a 3-role assignment is polynomial-time solvable on complementary prisms
by: Castonguay, Diane, et al.
Published: (2024)

Distance Critical Graphs
by: Cooper, Joshua, et al.
Published: (2024)

On treewidth and maximum cliques
by: Chudnovsky, Maria, et al.
Published: (2024)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
by: Loth, Jesse Campion, et al.
Published: (2022)

Some Thoughts on Graph Similarity
by: Grohe, Martin
Published: (2024)

Open Packing in Graphs: Bounds and Complexity
by: Shalu, M. A., et al.
Published: (2024)

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

Singular Values Versus Expansion in Directed and Undirected Graphs
by: Ruotolo, Jake, et al.
Published: (2025)

Recognizing Relating Edges in Graphs without Cycles of Length 6
by: Levit, Vadim E., et al.
Published: (2024)

On the structure of ($4K_1$, $C_4$, $P_6$)-free graphs
by: Hoàng, Chính T., et al.
Published: (2025)

Coloring Graphs With No Totally Odd Clique Immersion
by: McFarland, Caleb
Published: (2025)

Gallai's Path Decomposition for 2-degenerate Graphs
by: Anto, Nevil, et al.
Published: (2022)

Secure Total Domination Number in Maximal Outerplanar Graphs
by: Aita, Yasufumi, et al.
Published: (2024)

A Lower bound for Secure Domination Number of an Outerplanar Graph
by: Araki, Toru
Published: (2024)

Models of random spanning trees
by: Babson, Eric, et al.
Published: (2024)

The Local Structure Theorem for Graph Minors with finite index
by: Paul, Christophe, et al.
Published: (2025)

On minimally tough chordal graphs
by: Dallard, Clément, et al.
Published: (2022)

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

On Brooks' Theorem
by: Sajith, Gopalan, et al.
Published: (2022)

Towards a Dual Version of Woodall's Conjecture for Partial 3-Trees
by: Gutiérrez, Juan
Published: (2024)

Domination and packing in graphs
by: Gómez, Renzo, et al.
Published: (2024)

Capacitated Network Bargaining Games: Stability and Structure
by: Sanità, Laura, et al.
Published: (2023)

Reuniting $χ$-boundedness with polynomial $χ$-boundedness
by: Chudnovsky, Maria, et al.
Published: (2023)

A characterization of interval nest digraphs
by: Alcantar, Ayelén, et al.
Published: (2026)

Quasi-kernels in split graphs
by: Langlois, Hélène, et al.
Published: (2023)

Fractional Chromatic Numbers from Exact Decision Diagrams
by: Brand, Timo, et al.
Published: (2024)

Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths
by: Basavaraju, Manu, et al.
Published: (2021)

Partition strategies for the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2024)

Flip-width: Cops and Robber on dense graphs
by: Toruńczyk, Szymon
Published: (2023)

Directed branch-width: A directed analogue of tree-width
by: Bumpus, Benjamin Merlin, et al.
Published: (2020)