Pages that link to "Item:Q1079583"
From MaRDI portal
The following pages link to Graph minors. V. Excluding a planar graph (Q1079583):
Displaying 50 items.
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Excluding a ladder (Q2095109) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
- The grid theorem for vertex-minors (Q2099410) (← links)
- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation (Q2099416) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width (Q2121810) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Tree-width dichotomy (Q2136198) (← links)
- On objects dual to tree-cut decompositions (Q2171026) (← links)
- Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Tangle-tree duality in abstract separation systems (Q2217534) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Sublinear search spaces for shortest path planning in grid and road networks (Q2230730) (← links)
- Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
- Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
- Tree-width and planar minors (Q2259855) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Treewidth of graphs with balanced separations (Q2312607) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- In absence of long chordless cycles, large tree-width becomes a local phenomenon (Q2338644) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids (Q2384806) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632) (← links)
- Infinitely many minimal classes of graphs of unbounded clique-width (Q2413975) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width (Q2421546) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Minimum degree conditions for vertex-disjoint even cycles in large graphs (Q2439893) (← links)
- Square roots of minor closed graph classes (Q2442205) (← links)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Breaking the rhythm on graphs (Q2476277) (← links)
