Pages that link to "Item:Q1346772"
From MaRDI portal
The following pages link to The complexity of induced minors and related problems (Q1346772):
Displaying 36 items.
- Graph editing to a fixed target (Q344855) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- Finding induced trees (Q967418) (← links)
- On the complexity of testing for odd holes and induced odd paths (Q1175980) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- Induced circuits in planar graphs (Q1322013) (← links)
- Satisfiability of co-nested formulas (Q1323332) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- On a class of covering problems with variable capacities in wireless networks (Q2339450) (← links)
- Detecting induced star-like minors in polynomial time (Q2376792) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- Claw-free \(t\)-perfect graphs can be recognized in polynomial time (Q2804992) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Contracting bipartite graphs to paths and cycles (Q5915810) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Contracting bipartite graphs to paths and cycles (Q5920049) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
- Recognizing unit multiple interval graphs is hard (Q6648267) (← links)
