Constructing a bipartite graph of maximum connectivity with prescribed degrees

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199707)29:4<245::AID-NET7>3.0.CO;2-F" /><245::AID-NET7>3.0.CO;2-F 10.1002/(SICI)1097-0037(199707)29:4<245::AID-NET7>3.0.CO;2-FzbMath0876.05092OpenAlexW2037308449MaRDI QIDQ4347279

Takao Asano

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199707)29:4<245::aid-net7>3.0.co;2-f

zbMATH Keywords

bipartite graphcharacterizationconnectivitydegreesbipartite graphical sequence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph theory (05C99) Connectivity (05C40)

Related Items (1)

Unnamed Item

This page was built for publication: Constructing a bipartite graph of maximum connectivity with prescribed degrees