The following pages link to (Q4273877):
Displaying 18 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- (Q2857321) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- (Q5009461) (← links)
- Induced minors and well-quasi-ordering (Q5890902) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem (Q6615767) (← links)
