A lower bound for the vertex boundary-width of complete \(k\)-ary trees
From MaRDI portal
Publication:2427498
DOI10.1016/j.disc.2007.05.014zbMath1145.05031MaRDI QIDQ2427498
Publication date: 13 May 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.05.014
Related Items
A note on isoperimetric peaks of complete trees, Bounds on isoperimetric values of trees, Isoperimetric Problem and Meta-fibonacci Sequences
Cites Work
- Compressions and isoperimetric inequalities
- The treewidth and pathwidth of hypercubes
- A short proof for a theorem of Harper about Hamming-spheres
- The vertex separation number of a graph equals its path-width
- On an isoperimetric problem for Hamming graphs
- Discrete Isoperimetric Problems
- Handbook of Graph Theory
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Optimal numberings and isoperimetric problems on graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item