Pages that link to "Item:Q1179473"
From MaRDI portal
The following pages link to Graph minors. X: Obstructions to tree-decomposition (Q1179473):
Displaying 50 items.
- Canonical tree-decompositions of finite graphs. II. Essential parts (Q257005) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Canonical tree-decompositions of a graph that display its \(k\)-blocks (Q345066) (← links)
- Rooted grid minors (Q345092) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Connectivity and tree structure in finite graphs (Q397061) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- Graph minors. XXII. Irrelevant vertices in linkage problems (Q412177) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- Forbidden minors for graphs with no first obstruction to parametric Feynman integration (Q482194) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Linear connectivity forces large complete bipartite minors: an alternative approach (Q651041) (← links)
- Packing cycles with modularity constraints (Q653988) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Connected graph searching (Q690489) (← links)
- Graph minors. XX: Wagner's conjecture (Q705888) (← links)
- The carving-width of generalized hypercubes (Q710586) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Connectivity functions and polymatroids (Q730631) (← links)
- A short proof that every finite graph has a tree-decomposition displaying its tangles (Q739050) (← links)
- Tangles, trees, and flowers (Q744163) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- Separations of sets (Q781544) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Matroid tree-width (Q852702) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- Testing branch-width (Q875941) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (Q895993) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
