Pages that link to "Item:Q2639869"
From MaRDI portal
The following pages link to Graph minors. IV: Tree-width and well-quasi-ordering (Q2639869):
Displayed 50 items.
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- Graph minors. XX: Wagner's conjecture (Q705888) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Nested cycles in large triangulations and crossing-critical graphs (Q765192) (← links)
- Graph minors. III. Planar tree-width (Q799684) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- How to contract an essentially 6-connected graph to a 5-connected graph (Q864138) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Graph minors. I. Excluding a forest (Q1055450) (← links)
- Graphs without \(K_ 4\) and well-quasi-ordering (Q1058531) (← links)
- A Menger-like property of tree-width: The finite case (Q1097894) (← links)
- Grids and their minors (Q1097897) (← links)
- On well-quasi-ordering-finite graphs by immersion (Q1104345) (← links)
- Graph minors. X: Obstructions to tree-decomposition (Q1179473) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Highly connected sets and the excluded grid theorem (Q1306423) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- A simpler proof of the excluded minor theorem for higher surfaces (Q1362099) (← links)
- Branch-width and Rota's conjecture (Q1403924) (← links)
- Graph minors. XVIII: Tree-decompositions and well-quasi-ordering (Q1410732) (← links)
- Graph minors. XIX: Well-quasi-ordering on a surface. (Q1426103) (← links)
- Multiplicities of eigenvalues and tree-width of graphs (Q1569029) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Well-quasi-ordering versus clique-width (Q1745730) (← links)
- A unified treatment of linked and lean tree-decompositions (Q1745735) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- Branch-width and well-quasi-ordering in matroids and graphs. (Q1850591) (← links)
- Embedding grids in surfaces (Q1883290) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Treewidth is a lower bound on graph gonality (Q2200865) (← links)
- Finite structure for Friedman ideals of finite trees (Q2259862) (← links)
- Algorithm for finding structures and obstructions of tree ideals (Q2370450) (← links)
- Evaluating interval-valued influence diagrams (Q2374538) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (Q2427899) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- Graph minors. VIII: A Kuratowski theorem for general surfaces (Q2639870) (← links)
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)