Pages that link to "Item:Q2530476"
From MaRDI portal
The following pages link to Maximum internally stable sets of a graph (Q2530476):
Displaying 7 items.
- Clique detection for nondirected graphs: Two new algorithms (Q1143177) (← links)
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909) (← links)
- Covers, matchings and odd cycles of a graph (Q1219306) (← links)
- The maximum clique problem (Q1318271) (← links)
- Determining the number of internal stability of a graph (Q3960887) (← links)
- Minimum decomposition of partially ordered sets into chains (Q4051928) (← links)
- Graph theory (Q5917392) (← links)