The following pages link to Graph minor theory (Q3372389):
Displaying 45 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry (Q306575) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Positive braids of maximal signature (Q495210) (← links)
- On the subgraph epimorphism problem (Q741740) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- Neighborhood contraction in graphs (Q1616737) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor. II (Q1931398) (← links)
- Weakly distinguishing graph polynomials on addable properties (Q2211265) (← links)
- The average cut-rank of graphs (Q2225395) (← links)
- P-RAM vs. RP-RAM (Q2402257) (← links)
- Genera and minors of multibranched surfaces (Q2405103) (← links)
- Pathwidth, trees, and random embeddings (Q2439830) (← links)
- Square roots of minor closed graph classes (Q2442205) (← links)
- (Q2857350) (← links)
- Belief propagation and loop series on planar graphs (Q2900172) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Framed 4-valent graph minor theory I: Introduction. A planarity criterion and linkless embeddability (Q2930980) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q3387757) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- Framed 4-valent graph minor theory II: Special minors and new examples (Q3461769) (← links)
- MINORS IN WEIGHTED GRAPHS (Q3533776) (← links)
- REGULAR PROJECTIONS OF GRAPHS WITH AT MOST THREE DOUBLE POINTS (Q3586220) (← links)
- Metrically homogeneous graphs of diameter 3 (Q4991900) (← links)
- (Q5005146) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
- (Q5088974) (← links)
- Two-Planar Graphs Are Quasiplanar (Q5111262) (← links)
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited (Q5229963) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- On the pathwidth of hyperbolic 3-manifolds (Q5881542) (← links)
- Clique minors in graphs with a forbidden subgraph (Q6074687) (← links)
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023 (Q6076085) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)
- Quantum routing in planar graph using perfect state transfer (Q6089494) (← links)
- Super domination: graph classes, products and enumeration (Q6130203) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q6139828) (← links)
