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

Definition & Example

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

Further definitions

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


Sage examples

Technical information for database usage

If you want to edit this wiki page, you can download the raw markdown and send your new version to info@findstat.org