Pages that link to "Item:Q799684"
From MaRDI portal
The following pages link to Graph minors. III. Planar tree-width (Q799684):
Displaying 50 items.
- Posets with cover graph of pathwidth two have bounded dimension (Q304175) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- On the complexity of connection games (Q307770) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Tree-width of hypergraphs and surface duality (Q414640) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Consequence-based and fixed-parameter tractable reasoning in description logics (Q490523) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Complexity of semi-stable and stage semantics in argumentation frameworks (Q656597) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- Complexity of secure sets (Q722534) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- 2-connecting outerplanar graphs without blowing up the pathwidth (Q744095) (← links)
- Nested cycles in large triangulations and crossing-critical graphs (Q765192) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
- Tree-chromatic number (Q896001) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- A characterization of some graph classes using excluded minors (Q950291) (← links)
- Partitions versus sets: a case of duality (Q966122) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Graph minors. I. Excluding a forest (Q1055450) (← links)
- Grids and their minors (Q1097897) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Graph minors. VII: Disjoint paths on a surface (Q1111568) (← links)
- The Menger-like property of the three-width of infinite graphs (Q1121910) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Datalog vs first-order logic (Q1342861) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
