Pages that link to "Item:Q4572004"
From MaRDI portal
The following pages link to Independent sets in asteroidal triple-free graphs (Q4572004):
Displaying 12 items.
- Independent sets in graphs (Q501998) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (Q1348907) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- On asteroidal sets in chordal graphs (Q2448883) (← links)
- Recognizing graphs without asteroidal triples (Extended abstract) (Q2766687) (← links)
- (Q4944739) (← links)
- Connected domination and steiner set on asteroidal triple-free graphs (Q5060107) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)