Pages that link to "Item:Q965247"
From MaRDI portal
The following pages link to Graph minors XXIII. Nash-Williams' immersion conjecture (Q965247):
Displaying 50 items.
- Coloring immersion-free graphs (Q326817) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem (Q405143) (← links)
- The structure of graphs not admitting a fixed immersion (Q473098) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Complete graph immersions in dense graphs (Q512586) (← links)
- A well-quasi-order for tournaments (Q618033) (← links)
- Well-structured graph transformation systems (Q729812) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Directed elimination games (Q896668) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory (Q1379838) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- A note on immersion minors and planarity (Q1744743) (← links)
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Parameterized verification of monotone information systems (Q1798673) (← links)
- Splitter theorems for 4-regular graphs (Q1959710) (← links)
- Packing and covering immersions in 4-edge-connected graphs (Q1984514) (← links)
- On clique immersions in line graphs (Q2005686) (← links)
- Clique immersions in graphs of independence number two with certain forbidden subgraphs (Q2022152) (← links)
- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation (Q2099416) (← links)
- Large immersions in graphs with independence number 3 and 4 (Q2132349) (← links)
- Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
- On objects dual to tree-cut decompositions (Q2171026) (← links)
- Routing with congestion in acyclic digraphs (Q2274522) (← links)
- Well-quasi-ordering \(H\)-contraction-free graphs (Q2413963) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
- Clique immersions and independence number (Q2674557) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- A Structure Theorem for Strong Immersions (Q2825487) (← links)
- Well-quasi-ordering hereditarily finite sets (Q2855754) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Constructing Graphs with No Immersion of Large Complete Graphs (Q2922213) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- Upper Bounds on the Graph Minor Theorem (Q3295150) (← links)
- Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems (Q3512494) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Tsirelson’s problem and an embedding theorem for groups arising from non-local games (Q5216992) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
