edit this page

Possible database queries for graphs: search your data / browse all statistics / browse all maps

1. Definition & Example

The four unlabelled graphs on 3 verticeselements with their canonical labelling

http://www.findstat.org/Graphics/api/Cc0020_0_([],3).png

http://www.findstat.org/Graphics/api/Cc0020_0_([(1,2)],3).png

http://www.findstat.org/Graphics/api/Cc0020_0_([(0,2),(0,1)],3).png

http://www.findstat.org/Graphics/api/Cc0020_0_([(0,1),(0,2),(1,2)],3).png

([],3)

([(1,2)],3)

([(0,1),(0,2)],3)

([(0,2),(2,1)],3)

2. FindStat representation and coverage

3. Additional information

3.1. Further Definitions

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

4. References

5. Sage examples


CategoryCombinatorialCollection