The following pages link to (Q3203054):
Displayed 4 items.
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- Integer Laplacian eigenvalues of chordal graphs (Q2229473) (← links)