Random triples
| Subject | Object |
|---|---|
| gptkb:Langford_pairing | Exists if and only if n mod 4 = 0 or n mod 4 = 3 |
| gptkb:Eulerian_paths | a connected undirected graph has an Eulerian path if and only if it has exactly zero or two vertices of odd degree |
| gptkb:Eulerian_paths | a directed graph has an Eulerian path if and only if at most one vertex has (out-degree) − (in-degree) = 1, at most one vertex has (in-degree) − (out-degree) = 1, and all other vertices have equal in-degree and out-degree |