Recommendations
Cites work
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- scientific article; zbMATH DE number 3332242 (Why is no real title available?)
- A characterisation of rigid circuit graphs
- A homology theory for spanning tress of a graph
- Ein Planaritaetskriterium für endliche Graphen
- From Matrices to Graphs
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. VII: Disjoint paths on a surface
- On Independent Circuits Contained in a Graph
- On rigid circuit graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
Cited in
(only showing first 100 items - show all)- Recognizability in the Simply Typed Lambda-Calculus
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
- Excluded minors for \([2,3]\)-graph planarity
- Polynomial kernels for hitting forbidden minors under structural parameterizations
- Treewidth of graphs with balanced separations
- Additive non-approximability of chromatic number in proper minor-closed classes
- The grid theorem for vertex-minors
- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
- Modification to Planarity is Fixed Parameter Tractable
- A new proof of the flat wall theorem
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- The structure of the models of decidable monadic theories of graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Tree pivot-minors and linear rank-width
- Additive non-approximability of chromatic number in proper minor-closed classes
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Layered separators in minor-closed graph classes with applications
- Obstructions for partitioning into forests and outerplanar graphs
- Contraction bidimensionality of geometric intersection graphs
- Tree-width dichotomy
- Approximating Pathwidth for Graphs of Small Treewidth
- Random graphs containing few disjoint excluded minors
- Faster 3-coloring of small-diameter graphs
- Packing cycles faster than Erdős-Pósa
- Tangle-tree duality in abstract separation systems
- Computing the largest bond and the maximum connected cut of a graph
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Graphs without large apples and the maximum weight independent set problem
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Infinitely many minimal classes of graphs of unbounded clique-width
- Linearity of grid minors in treewidth with applications through bidimensionality
- Boundary properties of graphs for algorithmic graph problems
- Clique-sums, tree-decompositions and compactness
- A Menger-like property of tree-cut width
- The edge-Erdős-Pósa property
- Critical properties of bipartite permutation graphs
- Excluding a planar matching minor in bipartite graphs
- Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs
- Hereditary classes of graphs: a parametric approach
- The edge-density for \(K_{2,t}\) minors
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- Algorithmic uses of the Feferman-Vaught theorem
- Minimal classes of graphs of unbounded clique-width
- The disjoint paths problem in quadratic time
- The Maximum Independent Set Problem in Planar Graphs
- Critical elements in combinatorially closed families of graph classes
- Linkless and flat embeddings in 3-space
- On Tseitin formulas, read-once branching programs and treewidth
- Product structure extension of the Alon-Seymour-Thomas theorem
- Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
- Elimination Distance to Bounded Degree on Planar Graphs
- Sublinear search spaces for shortest path planning in grid and road networks
- On modal \(\mu \)-calculus over finite graphs with small components or small tree width
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- Grid induced minor theorem for graphs of small degree
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Induced subgraphs and path decompositions
- Rabin's theorem in the concurrency setting: a conjecture
- Graph minors. X: Obstructions to tree-decomposition
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- A note on immersion minors and planarity
- A unified treatment of linked and lean tree-decompositions
- Canonical representations of partial 2- and 3-trees
- Graph minors and parameterized algorithm design
- Recent developments on graphs of bounded clique-width
- Nonrepetitive colorings of graphs of bounded tree-width
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Discrete optimization methods for group model selection in compressed sensing
- Tree-width of graphs without a \(3\times 3\) grid minor
- Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Linear connectivity forces large complete bipartite minors
- scientific article; zbMATH DE number 4095479 (Why is no real title available?)
- Packing topological minors half‐integrally
- Nonrepetitive colorings of graphs
- Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems
- Excluded Forest Minors and the Erdős–Pósa Property
- Induced and weak induced arboricities
- Rankings of graphs
- Graph minor hierarchies
- About the domino problem for subshifts on groups
- \(K_4\)-subdivisions have the edge-Erdős-Pósa property
- A partial k-arboretum of graphs with bounded treewidth
- The complexity of learning minor closed graph classes
- Polynomial treewidth forces a large grid-like-minor
- Packing \(A\)-paths of length zero modulo four
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- Erdős-Pósa property of chordless cycles and its applications
- Certifying coloring algorithms for graphs without long induced paths
- Obstructions for bounded branch-depth in matroids
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
This page was built for publication: Graph minors. V. Excluding a planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079583)
