Bandwidth, treewidth, separators, expansion, and universality
From MaRDI portal
Publication:5300988
DOI10.1016/j.endm.2008.06.018zbMath1267.05228OpenAlexW2070535164MaRDI QIDQ5300988
Klaas P. Pruessmann, Andreas Würfl, Julia Böttcher, Anusch Taraz
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.018
Related Items (3)
Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ A Separator Theorem for String Graphs and its Applications ⋮ A Separator Theorem for String Graphs and Its Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Graph minors. VI. Disjoint paths across a disc
- Proof of the Seymour conjecture for large graphs
- Large planar subgraphs in dense graphs
- Spanning Trees in Dense Graphs
- A Separator Theorem for Planar Graphs
- The Blow-up Lemma
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- Proof of the Alon-Yuster conjecture
This page was built for publication: Bandwidth, treewidth, separators, expansion, and universality
