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