Pages that link to "Item:Q5898649"
From MaRDI portal
The following pages link to A 3-approximation for the pathwidth of Halin graphs (Q5898649):
Displayed 10 items.
- Fast searching games on graphs (Q411259) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- Drawing Halin-graphs with small height (Q5050008) (← links)
- Approximating Pathwidth for Graphs of Small Treewidth (Q6075751) (← links)