The following pages link to (Q4407447):
Displaying 26 items.
- On the queue-number of graphs with bounded tree-width (Q521397) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- The bivariate Ising polynomial of a graph (Q967288) (← links)
- On tree-partition-width (Q1024321) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- An improved planar graph product structure theorem (Q2152790) (← links)
- Graph drawings with few slopes (Q2385698) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- On a characterization of k-trees (Q2947993) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- The Size Ramsey Number of Graphs with Bounded Treewidth (Q5854459) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- Product structure extension of the Alon-Seymour-Thomas theorem (Q6573005) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
- Product structure of graph classes with bounded treewidth (Q6630446) (← links)
- Tree-partitions with bounded degree trees (Q6630448) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
- Product structure of graphs with an excluded minor (Q6653803) (← links)
