edit this page

Queries for Graphs: search statistic / browse statistics / browse maps from / browse maps to

1. Definition & Example

the 4 Graphs of size 3
  ([],3)   ([(1,2)],3)   ([(0,2),(1,2)],3)   ([(0,1),(0,2),(1,2)],3)

2. Further definitions

A nontrivial connected graph $G$ is Eularian if and only if every vertex of G has even degree.

3. References

4. Sage examples

5. Technical information for database usage