Pages that link to "Item:Q705888"
From MaRDI portal
The following pages link to Graph minors. XX: Wagner's conjecture (Q705888):
Displaying 50 items.
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Connected graph searching (Q690489) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Explicit bounds for graph minors (Q723881) (← links)
- Well-structured graph transformation systems (Q729812) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Universality of intervals of line graph order (Q740276) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- On the subgraph epimorphism problem (Q741740) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Nested cycles in large triangulations and crossing-critical graphs (Q765192) (← links)
- Finite dualities and map-critical graphs on a fixed surface (Q765196) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q777436) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Looking at the stars (Q820158) (← links)
- The micro-world of cographs (Q831855) (← links)
- Toric geometry of cuts and splits (Q841562) (← links)
- Minimal universal and dense minor closed classes (Q852708) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- Intrinsic linking and knotting of graphs in arbitrary 3-manifolds (Q863049) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Intrinsic linking in directed graphs (Q888454) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Minor relations for quadrangulations on the sphere (Q897227) (← links)
- Some open problems on excluding a uniform matroid (Q953908) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Graph minors XXIII. Nash-Williams' immersion conjecture (Q965247) (← links)
- Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture (Q966145) (← links)
- When excluding one matroid prevents infinite antichains (Q972858) (← links)
- Growth constants of minor-closed classes of graphs (Q974473) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- On canonical antichains (Q1011785) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Graph minors. XXI. graphs with unique linkages (Q1026001) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Excluding infinite minors (Q1191928) (← links)
- On obstructions to small face covers in planar graphs (Q1204479) (← links)
