The minimum size of graphs satisfying cut conditions

DOI10.1016/J.DAM.2017.11.014zbMath1380.05047OpenAlexW2773344014MaRDI QIDQ1701098

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

Publication date: 22 February 2018

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

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

zbMATH Keywords

bisectioncut conditionspath-pairable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (2)

Minimal 2-connected graphs satisfying the even cut condition ⋮ Note on the bisection width of cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on the diameter of path-pairable graphs
• Computing an st-numbering
• A note on the edges of the n-cube
• Isoperimetric numbers of graphs
• Networks communicating for each pairing of terminals

This page was built for publication: The minimum size of graphs satisfying cut conditions