Pages that link to "Item:Q2930265"
From MaRDI portal
The following pages link to A linear-time algorithm to find a separator in a graph excluding a minor (Q2930265):
Displayed 14 items.
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- On the maximum number of cliques in a graph embedded in a surface (Q648982) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- On the number of cliques in graphs with a forbidden minor (Q2399355) (← links)
- Number of Cliques in Graphs with a Forbidden Subdivision (Q3449861) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion (Q5855529) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- Approximating small balanced vertex separators in almost linear time (Q5919618) (← links)