Graph minors XXIII. Nash-Williams' immersion conjecture
From MaRDI portal
Publication:965247
DOI10.1016/j.jctb.2009.07.003zbMath1216.05151OpenAlexW2063554572MaRDI QIDQ965247
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.07.003
Related Items
Large immersions in graphs with independence number 3 and 4, Towards the Graph Minor Theorems for Directed Graphs, Fixed-Parameter Tractability of Treewidth and Pathwidth, Graph Minors and Parameterized Algorithm Design, FPT Suspects and Tough Customers: Open Problems of Downey and Fellows, Coloring immersion-free graphs, Constructing Graphs with No Immersion of Large Complete Graphs, Clique immersion in graphs without a fixed bipartite graph, On objects dual to tree-cut decompositions, On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory, Some recent progress and applications in graph minor theory, Forbidding Kuratowski Graphs as Immersions, A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three, Well-quasi-ordering \(H\)-contraction-free graphs, Structure of Graphs with Locally Restricted Crossings, Effective computation of immersion obstructions for unions of graph classes, Clique immersions and independence number, Rooted \(K_4\)-minors, A minimum degree condition forcing complete graph immersion, Clique immersion in graph products, A well-quasi-order for tournaments, Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs, Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem, Directed elimination games, Bounding branch-width, The graph minor theorem in topological combinatorics, The immersion-minimal infinitely edge-connected graph, Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems, Graph operations on parity games and polynomial-time algorithms, An FPT 2-approximation for tree-cut decomposition, Graph theory. Abstracts from the workshop held January 2--8, 2022, Splitter theorems for 4-regular graphs, Characterizing graphs of small carving-width, Forcing clique immersions through chromatic number, Cutwidth: obstructions and algorithmic aspects, The structure of graphs not admitting a fixed immersion, Upper Bounds on the Graph Minor Theorem, Recent Progress on Well-Quasi-ordering Graphs, Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes, Forbidden directed minors and Kelly-width, Packing and covering immersions in 4-edge-connected graphs, A note on immersion minors and planarity, Complete graph immersions in dense graphs, The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs, On the generalised colouring numbers of graphs that exclude a fixed minor, Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications, On clique immersions in line graphs, Clique immersions in graphs of independence number two with certain forbidden subgraphs, Routing with congestion in acyclic digraphs, Well-structured graph transformation systems, Parameterized verification of monotone information systems, Tsirelson’s problem and an embedding theorem for groups arising from non-local games, A Structure Theorem for Strong Immersions, Lean Tree-Cut Decompositions: Obstructions and Algorithms, Well-quasi-ordering hereditarily finite sets, Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation, Unnamed Item
Cites Work
