Pages that link to "Item:Q5741086"

The following pages link to To Approximate Treewidth, Use Treelength! (Q5741086):

Displaying 9 items.

• Data center interconnection networks are not hyperbolic (Q301597) (← links)
• On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
• Obstructions to a small hyperbolicity in Helly graphs (Q1625787) (← links)
• A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
• On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
• On the complexity of computing treebreadth (Q1987233) (← links)
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
• On the Complexity of Computing Treebreadth (Q2819486) (← links)
• Treelength of series-parallel graphs (Q6069145) (← links)