scientific article; zbMATH DE number 867644

MaRDI QIDQ4873756zbMATH OpenFDO

Authors W. Mader

Publication date 22 April 1996

zbMATH Keywords

connectivity numbercritically \(n\)-connected digraphsdigraph

Mathematics Subject Classification ID

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

Recommendations

• Properties of \(k\)-critically \(n\)-connected digraphs
• On critically connected digraphs
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Critical vertices in k-connected digraphs

Cited in

(14)

• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Generalizaions of critical connectivity of graphs
• Critical graphs with connected complements
• Disconnected g_c-critical graphs
• Critical vertices in k-connected digraphs
• On the number of noncritical vertices in strongly connected digraphs
• High connectivity keeping sets in graphs and digraphs
• Properties of \(k\)-critically \(n\)-connected digraphs
• A note on fragments in a locally k-critical n-connected graph.
• Tournaments and Semicomplete Digraphs
• On Vertex-Edge-Critically n-Connected Graphs
• On critically connected digraphs
• On the existence of noncritical vertices in digraphs
• On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\)

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