scientific article; zbMATH DE number 883222
From MaRDI portal
Publication:4879664
Recommendations
- On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences
- Characterization of digraphic sequences with strongly connected realizations
- An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph
- A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
Cited in
(2)
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 Q4879664)