Pages that link to "Item:Q1274912"
From MaRDI portal
The following pages link to A partial k-arboretum of graphs with bounded treewidth (Q1274912):
Displaying 50 items.
- Complexity and monotonicity results for domination games (Q266262) (← links)
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- On computational complexity of graph inference from counting (Q269786) (← links)
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Computational social choice for coordination in agent networks (Q314440) (← links)
- Roman domination in subgraphs of grids (Q324726) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Genus distributions for iterated claws (Q405081) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Nordhaus-Gaddum for treewidth (Q412239) (← links)
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs (Q412366) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- Segment representation of a subclass of co-planar graphs (Q418892) (← links)
- A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Genus distribution of \(P_3 \mathop\square P_n\) (Q449126) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Pebbling in semi-2-trees (Q526223) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design (Q544830) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- On the graph complement conjecture for minimum semidefinite rank (Q551287) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Matching interdiction (Q602686) (← links)
- Splitting trees at vertices (Q616363) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Scale free properties of random \(k\)-trees (Q626908) (← links)
