Pages that link to "Item:Q3586456"
From MaRDI portal
The following pages link to Contractions of Planar Graphs in Polynomial Time (Q3586456):
Displaying 23 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Containment relations in split graphs (Q765349) (← links)
- The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
- On planar perfectly contractile graphs (Q1359374) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Obtaining planarity by contracting few edges (Q1945931) (← links)
- Modulo orientations and matchings in graphs (Q2138971) (← links)
- Detecting induced star-like minors in polynomial time (Q2376792) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Contraction checking in graphs on surfaces (Q2904760) (← links)
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)
- Edge Contractions in Subclasses of Chordal Graphs (Q3010431) (← links)
- (Q4552202) (← links)
- MSOL Restricted Contractibility to Planar Graphs (Q4899253) (← links)
- (Q5250491) (← links)
- (Q5749310) (← 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)
