Pages that link to "Item:Q876727"
From MaRDI portal
The following pages link to Recognizing graphs without asteroidal triples (Q876727):
Displaying 11 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)
- Recognizing graphs without asteroidal triples (Extended abstract) (Q2766687) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
- Quasimonotone graphs (Q5918199) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
- Approximating the bandwidth for asteroidal triple-free graphs (Q6102320) (← links)
- Axiomatic characterization of the toll walk function of some graph classes (Q6132559) (← links)