Pages that link to "Item:Q6041871"
From MaRDI portal
The following pages link to Forcibly bipartite and acyclic (uni-)graphic sequences (Q6041871):
Displaying 10 items.
- On fractional realizations of graph degree sequences (Q405210) (← links)
- On forcibly connected graphic sequences (Q1185077) (← links)
- Adjacency relationships forced by a degree sequence (Q1756108) (← links)
- Solution to a forcible version of a graphic sequence problem (Q2141340) (← links)
- Minimal forbidden sets for degree sequence characterizations (Q2344782) (← links)
- A note on graphic sequences with no realization containing an induced four cycle (Q2927775) (← links)
- (Q3698836) (← links)
- Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results (Q5205659) (← links)
- An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences (Q5225547) (← links)
- On the faces of unigraphic 3-polytopes (Q6655703) (← links)