Cover Image

On vertex sets inducing tangles

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Albrechtsen, Sandra, von Bergen, Hanno, Jacobs, Raphael W., Knappe, Paul, Wollan, Paul
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C40, 05C83, 05C69
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Canonical tree-decompositions of chordal graphs
by: Jacobs, Raphael W., et al.
Published: (2025)

A grid theorem for strong immersions of walls
by: Diestel, Reinhard, et al.
Published: (2023)

Linked tree-decompositions into finite parts
by: Albrechtsen, Sandra, et al.
Published: (2024)

Counterexamples regarding linked and lean tree-decompositions of infinite graphs
by: Albrechtsen, Sandra, et al.
Published: (2024)

Efficiently distinguishing all tangles in locally finite graphs
by: Jacobs, Raphael W., et al.
Published: (2023)

Locally chordal graphs
by: Abrishami, Tara, et al.
Published: (2025)

A characterisation of graphs quasi-isometric to $K_4$-minor-free graphs
by: Albrechtsen, Sandra, et al.
Published: (2024)

A Menger-type theorem for two induced paths
by: Albrechtsen, Sandra, et al.
Published: (2023)

A structural duality for path-decompositions into parts of small radius
by: Albrechtsen, Sandra, et al.
Published: (2023)

Optimal trees of tangles: refining the essential parts
by: Albrechtsen, Sandra
Published: (2023)

Refining tree-decompositions so that they display the k-blocks
by: Albrechtsen, Sandra
Published: (2024)

Tangle-tree duality in infinite graphs
by: Albrechtsen, Sandra
Published: (2024)

Tangle structure trees II: trees of tangles and tangle-tree duality
by: von Bergen, Hanno, et al.
Published: (2026)

Displaying prescribed sets of ends by linked tree-decompositions
by: Albrechtsen, Sandra, et al.
Published: (2025)

Refining trees of tangles in abstract separation systems: inessential parts
by: Albrechtsen, Sandra
Published: (2023)

Obtaining trees of tangles from tangle-tree duality
by: Elbracht, Christian, et al.
Published: (2020)

A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs
by: Albrechtsen, Sandra, et al.
Published: (2025)

Canonical graph decompositions via local separations
by: Jacobs, Raphael W., et al.
Published: (2025)

The immersion-minimal infinitely edge-connected graph
by: Knappe, Paul, et al.
Published: (2022)

Small hitting sets for longest paths and cycles
by: Norin, Sergey, et al.
Published: (2025)

Canonical graph decompositions via coverings
by: Diestel, Reinhard, et al.
Published: (2022)

Obstructions for normally spanned sets of vertices
by: Lorenz, Nicola, et al.
Published: (2025)

Trees of tangles in abstract separation systems
by: Elbracht, Christian, et al.
Published: (2019)

The structure of group-labeled graphs forbidding an immersion
by: McCarty, Rose, et al.
Published: (2026)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

Treewidth versus clique number: induced minors
by: Hilaire, Claire, et al.
Published: (2024)

Critical edge sets in vertex-critical graphs
by: Skottova, Ema, et al.
Published: (2025)

Asymptotic half-grid and full-grid minors
by: Albrechtsen, Sandra, et al.
Published: (2024)

Tangle structure trees
by: von Bergen, Hanno, et al.
Published: (2026)

Characterising 4-tangles through a connectivity property
by: Carmesin, Johannes, et al.
Published: (2023)

Traits and tangles: An analysis of the Big Five paradigm by tangle-based clustering
by: von Bergen, Hanno, et al.
Published: (2024)

A canonical tree-of-tangles theorem for structurally submodular separation systems
by: Elbracht, Christian, et al.
Published: (2020)

The sharp upper bounds on the maximum degree and vertex-connectivity of claw-free 1-planar graphs
by: Zhang, Licheng, et al.
Published: (2025)

On an induced version of Menger's theorem
by: Hendrey, Kevin, et al.
Published: (2023)

Unique paired vs edge-vertex minimum dominating sets in trees
by: Miotk, Mateusz, et al.
Published: (2025)

Splitter Theorems for Graph Immersions
by: DeVos, Matt, et al.
Published: (2018)

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

On the number of outer connected dominating sets of graphs
by: Alikhani, Saeid, et al.
Published: (2011)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
by: Bousquet, Nicolas, et al.
Published: (2024)

Circuits through prescribed edges
by: Knappe, Paul, et al.
Published: (2018)