The following pages link to (Q4281510):
Displaying 8 items.
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- Transversals of longest cycles in chordal and bounded tree-width graphs (Q2294714) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
- The treewidth of 2-section of hypergraphs (Q5024663) (← links)
- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs (Q5425437) (← links)
- The Neighborhood Polynomial of Chordal Graphs (Q6045410) (← links)
