scientific article; zbMATH DE number 7267378

MaRDI QIDQ5128322zbMATH OpenFDO

Authors

Publication date 27 October 2020

zbMATH Keywords

clique numberdegree sequencedigraphsmaximally arc-connected

Mathematics Subject Classification ID

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

Recommendations

• Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs
• A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
• Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number
• Sufficient conditions for super-arc-connected digraphs
• Degree sequence conditions for maximally edge-connected graphs depending on the clique number
• Degree sequence conditions for maximally and super edge-connected digraphs depending on the clique number
• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
• Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
• Sufficient conditions for maximally edge-connected and super-edge-connected digraphs depending on the size
• Sufficient conditions for maximally edge-connected hypergraphs

Cited in

(3)

• A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
• Degree sequence conditions for maximally and super edge-connected digraphs depending on the clique number

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 Q5128322)