Minimal 2-connected graphs satisfying the even cut condition

DOI10.1016/j.ipl.2020.106080OpenAlexW3113871361MaRDI QIDQ2656344

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

Publication date: 11 March 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2020.106080

zbMATH Keywords

combinatorial problemsinterconnection networksbisection widtheven cut conditionextremal 2-connected graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on terminal-pairability in complete grid graphs
• Three-regular path pairable graphs
• Linkage on the infinite grid
• The minimum size of graphs satisfying cut conditions
• Note on the bisection width of cubic graphs
• Terminal-Pairability in Complete Graphs
• Networks communicating for each pairing of terminals
• The bisection width of cubic graphs

This page was built for publication: Minimal 2-connected graphs satisfying the even cut condition