Pages that link to "Item:Q673069"
From MaRDI portal
The following pages link to The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069):
Displaying 3 items.
- A simple proof that finding a maximal independent set in a graph is in NC (Q834937) (← 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)
- The maximal f-dependent set problem for planar graphs is in NC (Q6184372) (← links)