Pages that link to "Item:Q582121"
From MaRDI portal
The following pages link to Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121):
Displaying 4 items.
- A parallel algorithm for finding a triconnected component separator with an application (Q1339375) (← links)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125) (← links)
- Searching for<i>K</i><sub>3,3</sub>in linear time (Q3978382) (← links)
- Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs (Q4377126) (← links)