Pages that link to "Item:Q5252660"
From MaRDI portal
The following pages link to Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660):
Displaying 26 items.
- Minors and dimension (Q345115) (← links)
- Excluding subdivisions of bounded degree graphs (Q1633742) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
- Long induced paths in minor-closed graph classes and beyond (Q2684889) (← links)
- A Structure Theorem for Strong Immersions (Q2825487) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- An improved isomorphism test for bounded-tree-width graphs (Q5002745) (← links)
- (Q5090449) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors (Q5194622) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- Isomorphism Testing for Graphs Excluding Small Minors (Q5885601) (← links)
- Computing with Tangles (Q5890774) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- Packing topological minors half‐integrally (Q6134535) (← links)
- A Faster Isomorphism Test for Graphs of Small Degree (Q6139827) (← links)
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs (Q6144407) (← links)
- Isomorphism Testing Parameterized by Genus and Beyond (Q6188514) (← links)
