Pages that link to "Item:Q705888"

The following pages link to Graph minors. XX: Wagner's conjecture (Q705888):

Displaying 50 items.

• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• The great theorem of modern combinatorics (Q2912500) (← links)
• Finding cycles and trees in sublinear time (Q2925521) (← links)
• Framed 4-valent graph minor theory I: Introduction. A planarity criterion and linkless embeddability (Q2930980) (← links)
• The Excluded Minors for Isometric Realizability in the Plane (Q2968517) (← links)
• Bipartite induced subgraphs and well-quasi-ordering (Q3018076) (← links)
• INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES (Q3067865) (← links)
• Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
• A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
• TRIANGLE-Y EXCHANGES ON INTRINSIC KNOTTING OF ALMOST COMPLETE AND COMPLETE PARTITE GRAPHS (Q3225640) (← links)
• Well, Better and In-Between (Q3295144) (← links)
• The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
• Upper Bounds on the Graph Minor Theorem (Q3295150) (← links)
• Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
• Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
• (Q3305178) (← links)
• Graph minor theory (Q3372389) (← 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)
• GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING (Q3421556) (← links)
• On Vertex Partitions and the Colin de Verdière Parameter (Q3439630) (← links)
• On Flattenability of Graphs (Q3452282) (← links)
• On the Pathwidth of Almost Semicomplete Digraphs (Q3452843) (← links)
• Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
• Framed 4-valent graph minor theory II: Special minors and new examples (Q3461769) (← links)
• Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
• Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
• Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems (Q3512494) (← links)
• MINORS IN WEIGHTED GRAPHS (Q3533776) (← links)
• REGULAR PROJECTIONS OF GRAPHS WITH AT MOST THREE DOUBLE POINTS (Q3586220) (← links)
• On self‐immersions of infinite graphs (Q3630833) (← links)
• Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
• Matroids Determine the Embeddability of Graphs in Surfaces (Q3828019) (← links)
• Polynomial-time self-reducibility: theoretical motivations and practical results^∗ (Q4009694) (← links)
• On possible counterexamples to Negami's planar cover conjecture (Q4474283) (← links)
• QUBO formulation for the contact map overlap problem (Q4620297) (← links)
• Finite automata as characterizations of minor closed tree families (extended abstract) (Q4630274) (← links)
• The size of an intertwine (Q4632453) (← links)
• Recent developments in spatial graph theory (Q4635094) (← links)
• Order nine MMIK graphs (Q4635096) (← links)
• The 𝐾_{𝑛+5} and 𝐾_{3²,1ⁿ} families and obstructions to 𝑛-apex. (Q4635099) (← links)
• Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
• Arbitrary Overlap Constraints in Graph Packing Problems (Q4639933) (← links)
• The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
• (Q4683860) (← links)
• More intrinsically knotted graphs with 22 edges and the restoring method (Q4684558) (← links)