Pages that link to "Item:Q4505015"
From MaRDI portal
The following pages link to Subgraph Isomorphism in Planar Graphs and Related Problems (Q4505015):
Displayed 18 items.
- Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- (Q5091199) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Six-Critical Graphs on the Klein Bottle (Q5301014) (← links)
- Parameterized Graph Cleaning Problems (Q5302063) (← links)
- Coloring Triangle-Free Graphs on Surfaces (Q5387740) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- (Q5743390) (← links)
- (Q5743427) (← links)
- (Q5743478) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube (Q6162041) (← links)
- Approximating sparse quadratic programs (Q6180751) (← links)