Pages that link to "Item:Q876727"
From MaRDI portal
The following pages link to Recognizing graphs without asteroidal triples (Q876727):
Displaying 4 items.
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
