The following pages link to S-functions for graphs (Q1230790):
Displaying 50 items.
- Posets with cover graph of pathwidth two have bounded dimension (Q304175) (← links)
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem (Q405143) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Tree-width of hypergraphs and surface duality (Q414640) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Tensor network contractions for \#SAT (Q887094) (← links)
- Tree-chromatic number (Q896001) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- Directed NLC-width (Q906393) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- A note on partial 3-trees and homomorphism bases of graphs (Q1313444) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- Directed tree-width (Q1850539) (← links)
- Compatibility, desirability, and the running intersection property (Q1989412) (← links)
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Treewidth of the generalized Kneser graphs (Q2121803) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Treewidth and gonality of glued grid graphs (Q2181210) (← links)
- Treewidth is a lower bound on graph gonality (Q2200865) (← links)
- An improvement of Reed's treewidth approximation (Q2232243) (← links)
- Finite reflection groups and graph norms (Q2362589) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity (Q2413181) (← links)
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width (Q2421546) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- On strict brambles (Q2689118) (← links)
- Two approaches to Sidorenko’s conjecture (Q2790648) (← links)
- Integrating and Sampling Cuts in Bounded Treewidth Graphs (Q2833051) (← links)
- ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH (Q2909221) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
