DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Pathwidth
Pathwidth
On Treewidth and Graph Minors
Randomly Coloring Graphs of Logarithmically Bounded Pathwidth Shai Vardi
Minimal Acyclic Forbidden Minors for the Family of Graphs with Bounded Path-Width
Minor-Closed Graph Classes with Bounded Layered Pathwidth
Approximating the Maximum Clique Minor and Some Subgraph Homeomorphism Problems
Faster Algorithms Parameterized by Clique-Width
On the Pathwidth of Chordal Graphs
Treewidth and Pathwidth of Permutation Graphs
A Polynomial Excluded-Minor Approximation of Treedepth
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
Layered Separators in Minor-Closed Graph Classes with Applications
Grundy Distinguishes Treewidth from Pathwidth
Treewidth and Small Separators for Graphs with Small Chordality
Introduction to Reconfiguration
Structural Parameterizations for Boxicity
Circumference and Pathwidth of Highly Connected Graphs
00 a SAT Approach to Clique-Width
Tree-Decompositions of Small Pathwidthଁ
Top View
Forbidden Directed Minors and Directed Pathwidth
Exclusive Graph Searching Vs. Pathwidth Euripides Markou, Nicolas Nisse, Stéphane Pérennes
Bounded Combinatorial Width and Forbidden Substructures
The Effect of Planarization on Width
CS 163 & CS 265: Graph Algorithms Week 8: Coloring and Perfect
Tree-Depth of Graphs: Characterisations and Obstructions
Chapter 21 Pathwidth and Planar Graph Drawing
Efficient Parallel Recognition of Cographs
The Graph Parameter Hierarchy
Introduction to Treewidth
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs∗
Computing Treedepth
Representing Graphs As the Intersection of Cographs and Threshold Graphs
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
Computing Pathwidth Faster Than 2N?
Open Problems for the Barbados Graph Theory Workshop 2018
Nonrepetitive Graph Colouring
Treewidth in Verification