Degree sequence conditions for maximally edge-connected oriented graphs
type: Item
instance of: scholarly article
title: Degree sequence conditions for maximally edge-connected oriented graphs
zbMATH Open document ID: 1172.05323
author: Lutz Volkmann
published in: Applied Mathematics Letters
publication date: 2009-10-30T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5623837
zbMATH Keywords: oriented graph
zbMATH Keywords: edge-connectivity
zbMATH Keywords: degree sequence
zbMATH Keywords: oriented bipartite graph
MaRDI profile type: Publication
full work available at URL: j.aml.2006.01.011
OpenAlex ID: W2073109155
cites work: Degree realization of undirected graphs in reduced form
cites work: Q5461449
cites work: Q5689821
cites work: Q4350166
cites work: Q4355069
cites work: Bipartite graphs and digraphs with maximum connectivity
cites work: Q5616727
cites work: Q4405634
cites work: Q5709006
cites work: Connectivity of Regular Directed Graphs with Small Diameters
cites work: Q5629652
cites work: A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
DOI: 10.1016/J.AML.2006.01.011
description: scientific article; zbMATH DE number 5623837