Pages that link to "Item:Q3739139"
From MaRDI portal
The following pages link to Contractibility and NP-completeness (Q3739139):
Displayed 35 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs (Q783748) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Modulo orientations and matchings in graphs (Q2138971) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Detecting induced star-like minors in polynomial time (Q2376792) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Edge Contractions in Subclasses of Chordal Graphs (Q3010431) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- (Q5009627) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5891098) (← links)
- Contracting bipartite graphs to paths and cycles (Q5915810) (← links)
- Contracting bipartite graphs to paths and cycles (Q5920049) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327) (← links)
- The complexity of contracting bipartite graphs into small cycles (Q6039435) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable (Q6075759) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)