Category:Eulerian paths
Jump to navigation
Jump to search
trail in a finite graph which visits every edge exactly once   | |||||
| Upload media | |||||
| Instance of | |||||
|---|---|---|---|---|---|
| Subclass of |
| ||||
| Named after | |||||
| Discoverer or inventor | |||||
| |||||
 | |||||
Eulerian paths and Eulerian circuits.
Subcategories
This category has the following 3 subcategories, out of 3 total.
H
- Haus vom Nikolaus (35 F)
- Hierholzer's algorithm (11 F)
S
- Seven Bridges of Königsberg (60 F)
Media in category "Eulerian paths"
The following 13 files are in this category, out of 13 total.
21. Adolf Hoffmeister, Masaryk jedním tahem, 1936.jpg 919 × 1,024; 852 KB
Areteoctaedre.gif 396 × 405; 16 KB
Chuan2.JPG 233 × 300; 14 KB
Euler rid6exp.png 858 × 678; 694 KB
Eulerian path puzzles.svg 512 × 585; 5 KB
Graph with eulerianpath.svg 83 × 119; 8 KB
Hamiltonian platonic graphs.svg 512 × 1,280; 12 KB
Hexagram without lifting pen.svg 700 × 525; 3 KB
Labelled Eulergraph.svg 423 × 452; 11 KB
Parcoursoctaèdre.gif 396 × 405; 8 KB
Vemotnet.jpg 361 × 221; 16 KB
Đường đi Euler.gif 150 × 199; 36 KB
Đường đi Euler2.gif 275 × 252; 33 KB
