Graph minor theory
From MaRDI portal
Publication:3372389
DOI10.1090/S0273-0979-05-01088-8zbMATH Open1082.05082WikidataQ29037774 ScholiaQ29037774MaRDI QIDQ3372389FDOQ3372389
Authors: László Lovász 
Publication date: 20 February 2006
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
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
- Decomposition of regular matroids
- Graph minors. X: Obstructions to tree-decomposition
- Lectures on matroids
- Graph minors. XX: Wagner's conjecture
- Graph minors. XIII: The disjoint paths problem
- The strong perfect graph theorem
- Graph minors. V. Excluding a planar graph
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Disjoint paths in graphs
- 2-linked graphs
- Graph minors. III. Planar tree-width
- Decomposition of balanced matrices
- Highly linked graphs
- Graph minors. IX: Disjoint crossed paths
- A Kuratowski theorem for nonorientable surfaces
- The theory of well-quasi-ordering: a frequently discovered concept
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Graph minors. XVI: Excluding a non-planar graph
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Title not available (Why is that?)
- Graph minors. XVII: Taming a vortex
- Sachs' linkless embedding conjecture
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Graph minors. IV: Tree-width and well-quasi-ordering
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Title not available (Why is that?)
- Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
- Graph minors. XIX: Well-quasi-ordering on a surface.
- Automorphism groups of graphs and edge-contraction
- Graph minors and graphs on surfaces
- Graph minors and linkages
- Title not available (Why is that?)
Cited In (68)
- Title not available (Why is that?)
- Quantum routing in planar graph using perfect state transfer
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- Induced regular perfect graphs
- Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
- Title not available (Why is that?)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
- Super domination: graph classes, products and enumeration
- The great theorem of modern combinatorics
- Weakly distinguishing graph polynomials on addable properties
- Title not available (Why is that?)
- On minimal Folkman graphs
- Minimum difference representations of graphs
- Approximation of the Quadratic Knapsack Problem
- Wagner's conjecture and the graph-minor project
- Minors in graphs of large girth
- Metrically homogeneous graphs of diameter 3
- The complexity of two graph orientation problems
- The average cut-rank of graphs
- Graph minors. XX: Wagner's conjecture
- Belief propagation and loop series on planar graphs
- Framed 4-valent graph minor theory II: Special minors and new examples
- Neighborhood contraction in graphs
- Title not available (Why is that?)
- Linearity is strictly more powerful than contiguity for encoding graphs
- Graph minors and parameterized algorithm design
- Two-Planar Graphs Are Quasiplanar
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- Single source shortest paths in \(H\)-minor free graphs
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- On a minor-monotone graph invariant
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
- Square roots of minor closed graph classes
- Explicit bounds for graph minors
- Genera and minors of multibranched surfaces
- On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
- Graph minors. XIV: Extending an embedding
- Pathwidth, trees, and random embeddings
- On the excluded minor structure theorem for graphs of large tree-width
- The saga of minimum spanning trees
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
- Some recent progress and applications in graph minor theory
- Clique minors in graphs with a forbidden subgraph
- New tools and results in graph minor structure theory
- Framed 4-valent graph minor theory I: Introduction. A planarity criterion and linkless embeddability
- The circumference of a graph with no \(K_{3,t}\)-minor. II
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Minor-equivalence for infinite graphs
- Minors in Graphs with High Chromatic Number
- Testing outerplanarity of bounded degree graphs
- Positive braids of maximal signature
- P-RAM vs. RP-RAM
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
- Excluding a group-labelled graph
- On the pathwidth of hyperbolic 3-manifolds
- Regular projections of graphs with at most three double points
- The graph minor theorem in topological combinatorics
- Combinatorial optimization with 2-joins
- MINORS IN WEIGHTED GRAPHS
- On characterizations by nice forbidding sets
- Every minor-closed property of sparse graphs is testable
- On the subgraph epimorphism problem
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs
- Minimal Euclidean representations of graphs
- The Graph Minor Theorem Meets Algebra
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)
