Pages that link to "Item:Q4375644"
From MaRDI portal
The following pages link to Making an arbitrary filled graph minimal by removing fill edges (Q4375644):
Displaying 5 items.
- Minimizing elimination tree height can increase fill more than linearly (Q671941) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- A local reductive elimination for the fill-in of graphs (Q1910534) (← links)
- Deleting Edges from Ramsey Minimal Examples (Q3459998) (← links)
- Minimal elimination of planar graphs (Q5054857) (← links)