The minimum size of graphs satisfying cut conditions
type: Item
instance of: scholarly article
title: The minimum size of graphs satisfying cut conditions
zbMATH Open document ID: 1380.05047
author: Adam S. Jobson
author: André E. Kézdy
author: Jeno Lehel
published in: Discrete Applied Mathematics
publication date: 2018-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6842195
zbMATH Keywords: path-pairable graph
zbMATH Keywords: cut conditions
zbMATH Keywords: bisection
MaRDI profile type: Publication
full work available at URL: j.dam.2017.11.014
OpenAlex ID: W2773344014
cites work: Q4398864
cites work: Networks communicating for each pairing of terminals
cites work: Q4878286
cites work: Computing an st-numbering
cites work: Q4018554
cites work: Q3139528
cites work: Q4243059
cites work: A note on the edges of the n-cube
cites work: Q5596083
cites work: Q5294699
cites work: Note on the diameter of path-pairable graphs
cites work: Isoperimetric numbers of graphs
DOI: 10.1016/J.DAM.2017.11.014
description: scientific article; zbMATH DE number 6842195