The following pages link to Graph minor theory (Q3372389):
Displaying 50 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)
- Graph minors. XX: Wagner's conjecture (Q705888) (← links)
- Explicit bounds for graph minors (Q723881) (← links)
- On the subgraph epimorphism problem (Q741740) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Minimal Euclidean representations of graphs (Q965947) (← links)
- Minimum difference representations of graphs (Q968207) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- Minor-equivalence for infinite graphs (Q1296983) (← links)
- Neighborhood contraction in graphs (Q1616737) (← links)
- Wagner's conjecture and the graph-minor project (Q1861446) (← links)
- Graph minors. XIV: Extending an embedding (Q1898729) (← links)
- On a minor-monotone graph invariant (Q1907104) (← links)
- On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← 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)
- Excluding a group-labelled graph (Q2519025) (← links)
- On characterizations by nice forbidding sets (Q2857350) (← links)
- Belief propagation and loop series on planar graphs (Q2900172) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- The great theorem of modern combinatorics (Q2912500) (← links)
- Framed 4-valent graph minor theory I: Introduction. A planarity criterion and linkless embeddability (Q2930980) (← links)
- New tools and results in graph minor structure theory (Q3179077) (← 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)
- (Q4352949) (← links)
- Minors in graphs of large girth (Q4800396) (← 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)
- The Graph Minor Theorem Meets Algebra (Q5059732) (← links)
