Pages that link to "Item:Q705888"
From MaRDI portal
The following pages link to Graph minors. XX: Wagner's conjecture (Q705888):
Displaying 50 items.
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- Conformal growth rates and spectral geometry on distributional limits of graphs (Q2072081) (← links)
- Local certification of graphs on surfaces (Q2078616) (← links)
- Chirality for simple graphs of size up to 12 (Q2084810) (← links)
- Remarks on a paper of J. Barát and P.P. Varjú (Q2086418) (← links)
- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation (Q2099416) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method (Q2106620) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Large immersions in graphs with independence number 3 and 4 (Q2132349) (← links)
- Tree-width dichotomy (Q2136198) (← links)
- An infinite antichain of planar tanglegrams (Q2140994) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Excluded checkerboard colourable ribbon graph minors (Q2144588) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Bipartite intrinsically knotted graphs with 23 edges (Q2166281) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- An algorithm for delta-wye reduction of almost-planar graphs (Q2197481) (← links)
- Filtration simplification for persistent homology via edge contraction (Q2203349) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory (Q2221497) (← links)
- Non-separating planar graphs (Q2223464) (← links)
- All minor-minimal apex obstructions with connectivity two (Q2223478) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Multigraded commutative algebra of graph decompositions (Q2248919) (← links)
- On the geometric Ramsey number of outerplanar graphs (Q2256584) (← links)
- Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
- Two forbidden induced subgraphs and well-quasi-ordering (Q2275404) (← links)
- Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Matroids, delta-matroids and embedded graphs (Q2318477) (← links)
- The poset of graphs ordered by induced containment (Q2326334) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Tournament minors (Q2343292) (← links)
- On well quasi-order of graph classes under homomorphic image orderings (Q2357228) (← links)
- Biased graphs. VII: Contrabalance and antivoltages (Q2384809) (← links)
- Computable linearizations of well-partial-orderings (Q2385530) (← links)
- Intrinsically linked graphs in projective space (Q2389450) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- On the number of cliques in graphs with a forbidden minor (Q2399355) (← links)
- Tree-width and dimension (Q2400108) (← links)
- A new intrinsically knotted graph with 22 edges (Q2401569) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
