Local 2-separators
From MaRDI portal
Publication:2673481
DOI10.1016/j.jctb.2022.04.005zbMath1490.05213arXiv2008.03032OpenAlexW4280610883MaRDI QIDQ2673481
Publication date: 10 June 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03032
localitystructural graph theory2-separator theoremcharacterisations of graphslocal cutverticeslocal separators
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Density (toughness, etc.) (05C42)
Related Items (3)
Local 2-separators ⋮ Characterising graphs with no subdivision of a wheel of bounded diameter ⋮ Entanglements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological cycle matroids of infinite graphs
- Canonical tree-decompositions of a graph that display its \(k\)-blocks
- Sparsity. Graphs, structures, and algorithms
- Graph clustering
- Covering theory for graphs of groups
- Graph minors. XX: Wagner's conjecture
- The strong perfect graph theorem
- Limits of dense graph sequences
- Every minor-closed property of sparse graphs is testable
- Decomposition of regular matroids
- Graph minors. X: Obstructions to tree-decomposition
- 3-connected reduction for regular graph covers
- The classification of finite and locally finite connected-homogeneous digraphs
- Graph minor hierarchies
- Recurrence of distributional limits of finite planar graphs
- Recurrence of planar graph limits
- On covers of graphs by Cayley graphs
- Local tree-width, excluded minors, and approximation algorithms
- Rank-width and vertex-minors
- Local 2-separators
- ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE
- Deciding first-order properties of locally tree-decomposable structures
- A Combinatorial Decomposition Theory
- Sparse exchangeable graphs and their limits via graphon processes
- Quasi-4-Connected Components
- Sparse Graphs Using Exchangeable Random Measures
- The classification of connected-homogeneous digraphs with more than one end
- Tree decompositions and social graphs
This page was built for publication: Local 2-separators
