Pages that link to "Item:Q5902532"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902532):
Displaying 7 items.
- On graph contractions and induced minors (Q415282) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648) (← links)
- Contractions of Planar Graphs in Polynomial Time (Q3586456) (← links)
- The computational complexity of graph contractions II: Two tough polynomially solvable cases (Q3632967) (← links)
- Contractibility and NP-completeness (Q3739139) (← links)