Pages that link to "Item:Q2819486"
From MaRDI portal
The following pages link to On the Complexity of Computing Treebreadth (Q2819486):
Displaying 6 items.
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- 3-colouring for dually chordal graphs and generalisations (Q2404614) (← links)
- Equivalence between pathbreadth and strong pathbreadth (Q2416435) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
