Pages that link to "Item:Q1762990"
From MaRDI portal
The following pages link to Diameter and treewidth in minor-closed graph families, revisited (Q1762990):
Displayed 15 items.
- The complexity of two graph orientation problems (Q412352) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Boundary Classes of Planar Graphs (Q3512606) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs (Q4933601) (← links)
- (Q5743390) (← links)