Pages that link to "Item:Q4630253"
From MaRDI portal
The following pages link to Treewidth and pathwidth of permutation graphs (Q4630253):
Displaying 5 items.
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- Treewidth and Pathwidth of Permutation Graphs (Q4863978) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)