Stable (graph theory)
In the Graph theory, a stable is a whole of tops two-to-two nonadjacent.
Research in a graph of a stable of size maximum is a traditional problem of the Théorie of complexity. The search for stable in a graph also amounts seeking a clicks in the reversed graph (one removes the edges of the graph and one adds those which were not there).
| Random links: | Aarhus | Bès | Ballet dancing of India | -1550 | Zaki Laïdi | Pierre Gloan | Johnny_Cade |