Pages that link to "Item:Q1410731"
From MaRDI portal
The following pages link to Graph minors. XVI: Excluding a non-planar graph (Q1410731):
Displaying 50 items.
- Contraction obstructions for treewidth (Q2275894) (← links)
- Simple PTAS's for families of graphs excluding a minor (Q2352263) (← 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)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- Excluding a group-labelled graph (Q2519025) (← 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)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- A Structure Theorem for Strong Immersions (Q2825487) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- On the Path Separability of Planar Graphs (Q2851515) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Templates for Binary Matroids (Q2968512) (← links)
- Graph minor theory (Q3372389) (← links)
- The Grad of a Graph and Classes with Bounded Expansion (Q3439315) (← links)
- Fraternal Augmentations of graphs, Coloration and Minors (Q3439588) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- Circle graph obstructions under pivoting (Q3633003) (← links)
- Forcing a <i>K<sub>r</sub></i> minor by high external connectivity (Q4537560) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs (Q4933601) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q5002722) (← links)
- (Q5009461) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors (Q5194622) (← links)
- The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids (Q5208744) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- (Q5743379) (← links)
- (Q5743487) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- (Q5875457) (← links)
- Isomorphism Testing for Graphs Excluding Small Minors (Q5885601) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Computing with Tangles (Q5890774) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5890901) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)
- On low rank-width colorings (Q5918207) (← links)
