Adobe PDF
(217.03 kB)
| Title Details: | |
|
Euler and Hamilton |
|
| Authors: |
Nikolopoulos, Stavros, (ed.), (tr.) Manolopoulos, Ioannis, (ed.), (tr.) |
| Description: | |
| Abstract: |
Algorithms for finding Eulerian circuits and trails are presented. Important terms are given: closed walk, closed trail, closed circuit, Eulerian circuit and trail, Hamiltonian cycle and path, minimum degree, maximum degree, closure of a graph.
|
| Linguistic Editors: |
Oxenkioun, Eleni Elissavet |
| Technical Editors: |
Karatzidis, Dimitrios |
| Type: |
Chapter |
| Creation Date: | 28-06-2024 |
| Item Details: | |
| License: |
Attribution - NonCommercial - ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| Handle | http://hdl.handle.net/11419/13654 |
| Bibliographic Reference: | Nikolopoulos, S., & Manolopoulos, I. (2024). Euler and Hamilton [Chapter]. In Nikolopoulos, S., & Manolopoulos, I. 2024. Combinatorics [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/13654 |
| Language: |
Greek |
| Is Part of: |
Combinatorics |
| Publication Origin: |
Kallipos, Open Academic Editions |