Pages that link to "Item:Q3632967"

The following pages link to The computational complexity of graph contractions II: Two tough polynomially solvable cases (Q3632967):

Displayed 13 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)
• Contracting planar graphs to contractions of triangulations (Q635743) ‎ (← links)
• Containment relations in split graphs (Q765349) ‎ (← links)
• Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) ‎ (← links)
• Detecting induced star-like minors in polynomial time (Q2376792) ‎ (← links)
• Increasing the Minimum Degree of a Graph by Contractions (Q2891338) ‎ (← links)
• Edge Contractions in Subclasses of Chordal Graphs (Q3010431) ‎ (← links)
• The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648) ‎ (← links)
• Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327) ‎ (← links)
• Contracting to a longest path in H-free graphs (Q6065420) ‎ (← links)