Characterization of digraphic sequences with strongly connected realizations
From MaRDI portal
Recommendations
Cites work
- A Note onn-Edge-Connectivity
- A remark on the existence of finite graphs
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Construction of a Maximally Edge-Connected Graph with Prescribed Degrees
- Existence of k-edge connected ordinary graphs with prescribed degrees
- scientific article; zbMATH DE number 3588696 (Why is no real title available?)
- scientific article; zbMATH DE number 713480 (Why is no real title available?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- Partitions and Their Representative Graphs
- Zero-one matrices with zero trace
Cited in
(9)- On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences
- Degree sequence for \(k\)-arc strongly connected multiple digraphs
- A Characterization of the extended DII-sequence
- A note on the characterization of digraphic sequences
- scientific article; zbMATH DE number 25611 (Why is no real title available?)
- scientific article; zbMATH DE number 883222 (Why is no real title available?)
- scientific article; zbMATH DE number 932617 (Why is no real title available?)
- Supermodularity in unweighted graph optimization. I: Branchings and matchings
- Supermodularity in unweighted graph optimization. III: Highly connected digraphs
This page was built for publication: Characterization of digraphic sequences with strongly connected realizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958207)
