Pages that link to "Item:Q705888"
From MaRDI portal
The following pages link to Graph minors. XX: Wagner's conjecture (Q705888):
Displaying 50 items.
- Stabilizer theorems for even cycle matroids (Q256984) (← links)
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Excluded-minor characterization of apex-outerplanar graphs (Q292261) (← links)
- Ribbon graph minors and low-genus partial duals (Q295294) (← links)
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Posets with cover graph of pathwidth two have bounded dimension (Q304175) (← links)
- Scattered packings of cycles (Q306707) (← links)
- On the graph condition regarding the \(F\)-inverse cover problem (Q309948) (← links)
- An universality argument for graph homomorphisms (Q322345) (← links)
- Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors (Q324834) (← links)
- Obstructions for two-vertex alternating embeddings of graphs in surfaces (Q326654) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Minors and dimension (Q345115) (← links)
- Transforms and minors for binary functions (Q368460) (← links)
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Rao's degree sequence conjecture (Q401494) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- Outerplanar obstructions for a feedback vertex set (Q412287) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Intrinsically linked signed graphs in projective space (Q427861) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On structural descriptions of lower ideals of series parallel posets (Q466868) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Forbidden minors for graphs with no first obstruction to parametric Feynman integration (Q482194) (← links)
- Complete monotonicity for inverse powers of some combinatorially defined polynomials (Q483372) (← links)
- Chromatic number and complete graph substructures for degree sequences (Q485549) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Odd complete minors in even embeddings on surfaces (Q501046) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Theta rank, levelness, and matroid minors (Q505908) (← links)
- Complete graph immersions in dense graphs (Q512586) (← links)
- The strong Arnold property for 4-connected flat graphs (Q518116) (← links)
- Ramsey numbers of cubes versus cliques (Q519968) (← links)
- Obstructions for embedding cubic graphs on the spindle surface (Q598469) (← links)
- Well-quasi-order of relabel functions (Q603891) (← links)
- A well-quasi-order for tournaments (Q618033) (← links)
- The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← links)
- The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
- Grid classes and partial well order (Q645965) (← links)
