The following pages link to On Strong Tree-Breadth (Q2958304):
Displaying 5 items.
- Strong tree-cographs are Birkhoff graphs (Q1119942) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Equivalence between pathbreadth and strong pathbreadth (Q2416435) (← links)
- Strong WQO Tree Theorems (Q3295147) (← links)