Pages that link to "Item:Q5205659"
From MaRDI portal
The following pages link to Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results (Q5205659):
Displaying 4 items.
- On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees. (Q960504) (← links)
- Constructing a bipartite graph of maximum connectivity with prescribed degrees (Q4347279) (← links)
- An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences (Q5225547) (← links)
- Rao's theorem for forcibly planar sequences revisited (Q6570032) (← links)