Recommendations
- Graph minors and linkages
- scientific article; zbMATH DE number 3906520
- Graph minors and minimum degree
- Complete graph minors and the graph minor structure theorem
- Graph minors: generalizing Kuratowski's theorem
- The graph minor theorem in topological combinatorics
- Minors in graphs of large girth
- The Graph Minor Theorem Meets Algebra
- scientific article; zbMATH DE number 1057880
- MINORS IN WEIGHTED GRAPHS
Cites work
- 2-linked graphs
- A Kuratowski theorem for nonorientable surfaces
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Automorphism groups of graphs and edge-contraction
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Decomposition of balanced matrices
- Decomposition of regular matroids
- Disjoint paths in graphs
- Graph minors and graphs on surfaces
- Graph minors and linkages
- Graph minors. III. Planar tree-width
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. IX: Disjoint crossed paths
- Graph minors. V. Excluding a planar graph
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XIX: Well-quasi-ordering on a surface.
- Graph minors. XVI: Excluding a non-planar graph
- Graph minors. XVII: Taming a vortex
- Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
- Graph minors. XX: Wagner's conjecture
- Highly linked graphs
- scientific article; zbMATH DE number 3146886 (Why is no real title available?)
- scientific article; zbMATH DE number 3311627 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- Lectures on matroids
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Sachs' linkless embedding conjecture
- The strong perfect graph theorem
- The theory of well-quasi-ordering: a frequently discovered concept
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(75)- Minor-equivalence for infinite graphs
- Neighborhood contraction in graphs
- Wagner's conjecture and the graph-minor project
- Graph minors. XIV: Extending an embedding
- On a minor-monotone graph invariant
- On the excluded minor structure theorem for graphs of large tree-width
- The circumference of a graph with no \(K_{3,t}\)-minor. II
- Weakly distinguishing graph polynomials on addable properties
- The average cut-rank of graphs
- P-RAM vs. RP-RAM
- Genera and minors of multibranched surfaces
- Pathwidth, trees, and random embeddings
- Square roots of minor closed graph classes
- Excluding a group-labelled graph
- Linearity is strictly more powerful than contiguity for encoding graphs
- On characterizations by nice forbidding sets
- Belief propagation and loop series on planar graphs
- Graph minors and parameterized algorithm design
- The great theorem of modern combinatorics
- Framed 4-valent graph minor theory. I: Introduction. A planarity criterion and linkless embeddability
- On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
- New tools and results in graph minor structure theory
- Approximation of the quadratic knapsack problem
- The ideal approach to computing closed subsets in well-quasi-orderings
- Random walks and forbidden minors. I: An \(n^{1/2+o(1)}\)-query one-sided tester for minor closed properties on bounded degree graphs
- Linearity is strictly more powerful than contiguity for encoding graphs
- Framed 4-valent graph minor theory II: Special minors and new examples
- MINORS IN WEIGHTED GRAPHS
- Regular projections of graphs with at most three double points
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- The complexity of two graph orientation problems
- scientific article; zbMATH DE number 1342090 (Why is no real title available?)
- scientific article; zbMATH DE number 1057880 (Why is no real title available?)
- The saga of minimum spanning trees
- Minors in graphs of large girth
- scientific article; zbMATH DE number 795221 (Why is no real title available?)
- Testing outerplanarity of bounded degree graphs
- Positive braids of maximal signature
- Metrically homogeneous graphs of diameter \(3\)
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
- The Graph Minor Theorem Meets Algebra
- 3-manifold triangulations with small treewidth
- Two-Planar Graphs Are Quasiplanar
- Minors in Graphs with High Chromatic Number
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- On the pathwidth of hyperbolic 3-manifolds
- On minimal Folkman graphs
- Clique minors in graphs with a forbidden subgraph
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
- Quantum routing in planar graph using perfect state transfer
- Super domination: graph classes, products and enumeration
- The graph minor theorem in topological combinatorics
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
- Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
- Induced regular perfect graphs
- Forbidden minors: finding the finite few
- On \(\mathcal{C}\)-perfection of modular product of graphs
- Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
- On cut polytopes and graph minors
- Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
- Mixtures of discrete decomposable graphical models
- Graph minors. XX: Wagner's conjecture
- Embedding simply connected 2-complexes in 3-space
- On the subgraph epimorphism problem
- Combinatorial optimization with 2-joins
- Some recent progress and applications in graph minor theory
- Every minor-closed property of sparse graphs is testable
- Minimal Euclidean representations of graphs
- Minimum difference representations of graphs
- Single source shortest paths in H-minor free graphs
This page was built for publication: Graph minor theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372389)
