scientific article; zbMATH DE number 5575580

MaRDI QIDQ3635571zbMATH OpenFDO

Authors Lutz Volkmann

Publication date 6 July 2009

zbMATH Keywords

degree sequenceedge-connectivityoriented bipartite graphoriented graphsuper-edge-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 2191995
• Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number.
• Degree sequence conditions for maximally edge-connected oriented graphs
• Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
• Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
• Degree sequence conditions for maximally and super edge-connected digraphs depending on the clique number
• Edge-connectivity and edge-superconnectivity in sequence graphs
• Sufficient conditions for super-arc-strongly connected oriented graphs
• Degree sequence and supereulerian graphs
• scientific article; zbMATH DE number 6010646

Cited in

(14)

• Sufficient conditions for super-arc-strongly connected oriented graphs
• Degree sequence conditions for maximally edge-connected oriented graphs
• Super edge-connectivity of dense digraphs and graphs
• Using a progressive withdrawal procedure to study superconnectivity in digraphs
• Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
• Neighborhood and degree conditions for super-edge-connected bipartite digraphs
• Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
• Sufficient conditions for maximally edge-connected and super-edge-connected digraphs depending on the size
• Lower bounds of \(|X|\) and \(|Y|\) of edge-cut \( (X,Y)\) and maximality and superiority of a digraph
• Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number.
• scientific article; zbMATH DE number 6010646 (Why is no real title available?)
• scientific article; zbMATH DE number 2191995 (Why is no real title available?)
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Degree sequence of oriented k-hypergraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635571)