On the possibility, to travel around a graph without repetition and without cutting (Q1560118)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the possibility, to travel around a graph without repetition and without cutting |
scientific article; zbMATH DE number 2718072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the possibility, to travel around a graph without repetition and without cutting |
scientific article; zbMATH DE number 2718072 |
Statements
On the possibility, to travel around a graph without repetition and without cutting (English)
0 references
1873
0 references
Diese Möglichkeit tritt dann und nur dann ein, wenn der Liniezug keinen oder zwei sogenannte ungrade Knotenpunkte hat. Vergl. die ältere Darstellung in Listing's ``Vorstudien zur Topologie'' (Göttinger Studien, Bd. 1. 1847).
0 references
Hamiltonian circuits
0 references
