Note on the bisection width of cubic graphs

DOI10.1016/j.dam.2020.06.017zbMath1447.05109OpenAlexW3037813213MaRDI QIDQ2197453

Adam S. Jobson, André E. Kézdy, Jenő Lehel

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.06.017

zbMATH Keywords

communication networksbisection widthcubic and subcubic graphseven cut condition

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Related Items (1)

Minimal 2-connected graphs satisfying the even cut condition

Cites Work

• Unnamed Item
• Note on terminal-pairability in complete grid graphs
• Upper bounds on the bisection width of 3- and 4-regular graphs
• Three-regular path pairable graphs
• Constructions for cubic graphs with large girth
• Linkage on the infinite grid
• The minimum size of graphs satisfying cut conditions
• Terminal-Pairability in Complete Graphs
• Networks communicating for each pairing of terminals
• On the Edge-Expansion of Graphs
• The bisection width of cubic graphs

This page was built for publication: Note on the bisection width of cubic graphs