On the possibility, to travel around a graph without repetition and without cutting

DOI10.1007/BF01442866zbMATH Open05.0286.02OpenAlexW1973343935WikidataQ29030343 ScholiaQ29030343MaRDI QIDQ1560118

C. Hierholzer

Publication date: 1873

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/156599

zbMATH Keywords

Hamiltonian circuits

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Euler's theorem for regular CW-complexes ⋮ Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem ⋮ Cut-down de Bruijn sequences

This page was built for publication: On the possibility, to travel around a graph without repetition and without cutting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1560118)