Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
From MaRDI portal
Publication:976141
DOI10.1016/j.ejc.2009.10.010zbMath1231.05082arXiv0910.3014OpenAlexW2131867452WikidataQ56766816 ScholiaQ56766816MaRDI QIDQ976141
Klaas P. Pruessmann, Anusch Taraz, Julia Böttcher, Andreas Würfl
Publication date: 17 June 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.3014
Related Items
Local resilience of spanning subgraphs in sparse random graphs ⋮ A tight Erdős-Pósa function for long cycles ⋮ Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs ⋮ Succinct data structure for path graphs ⋮ Recent progress towards Hadwiger's conjecture ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ The bandwidth theorem for locally dense graphs ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ Ramsey numbers of cubes versus cliques ⋮ Ramsey-goodness -- and otherwise ⋮ Spanning embeddings of arrangeable graphs with sublinear bandwidth ⋮ Dominating sets reconfiguration under token sliding ⋮ On the relation of separability, bandwidth and embedding ⋮ Universality of random graphs and rainbow embedding ⋮ On exteriority notions in book embeddings and treewidth ⋮ Treewidth of graphs with balanced separations ⋮ Bandwidth theorem for random graphs ⋮ Almost spanning subgraphs of random graphs after adversarial edge removal ⋮ Forcing spanning subgraphs via Ore type conditions ⋮ Ramsey numbers for bipartite graphs with small bandwidth ⋮ On the bandwidth of the Kneser graph
Cites Work
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Distinct distances in graph drawings
- Graph minors. VI. Disjoint paths across a disc
- A partial k-arboretum of graphs with bounded treewidth
- Small universal graphs for bounded-degree planar graphs
- Graph drawings with few slopes
- On tree width, bramble size, and expansion
- Large planar subgraphs in dense graphs
- A separator theorem for graphs of bounded genus
- Expander graphs and their applications
- Embedding large subgraphs into dense graphs
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- A Separator Theorem for Planar Graphs
- A Separator Theorem for Nonplanar Graphs
- The Blow-up Lemma
- Sparse universal graphs for bounded‐degree graphs
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
This page was built for publication: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
