Neighborhood and degree conditions for super-edge-connected bipartite digraphs
type: Item
instance of: scholarly article
title: Neighborhood and degree conditions for super-edge-connected bipartite digraphs
zbMATH Open document ID: 1050.05075
DOI: 10.1007/BF03322996
author: Angelika Hellwig
author: Lutz Volkmann
published in: Results in Mathematics
publication date: 2004-10-28T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 2111444
zbMATH Keywords: edge connectivity
zbMATH Keywords: degree sequence
MaRDI profile type: Publication
cites work: Circulants and their connectivities
cites work: Q4350166
cites work: Q4856632
cites work: Q4355069
cites work: Maximally connected digraphs
cites work: Bipartite graphs and digraphs with maximum connectivity
cites work: On super-edge-connected digraphs and bipartite digraphs
cites work: A sufficient condition for equality of edge-connectivity and minimum degree of a graph
cites work: On graphs with equal edge-connectivity and minimum degree
cites work: Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
cites work: Results on the edge-connectivity of graphs
cites work: Super-edge-connectivity properties of graphs with diameter 2
cites work: Super edge-connectivity of dense digraphs and graphs
cites work: Q5463357
cites work: Q4826268
cites work: A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
description: scientific article; zbMATH DE number 2111444