On the possibility, to travel around a graph without repetition and without cutting
type: Item
instance of: scholarly article
title: On the possibility, to travel around a graph without repetition and without cutting
zbMATH Open document ID: 05.0286.02
DOI: 10.1007/BF01442866
author: C. Hierholzer
published in: Mathematische Annalen
publication date: 1873-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/156599
review text: 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).
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 2718072
zbMATH Keywords: Hamiltonian circuits
Wikidata QID: Q29030343
MaRDI profile type: Publication
OpenAlex ID: W1973343935
description: scientific article; zbMATH DE number 2718072