Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
International conference KNOWLEDGE-BASED ORGANIZATION
Volume 31 (2025): Issue 3 (June 2025)
Open Access
An Elementary Method of Determining Hamiltonian Paths in Oriented Graphs that Admit Circuits
Vasile Căruţaşu
Vasile Căruţaşu
“Nicolae Bălcescu” Land Forces Academy
Sibiu, Romania
Search for this author on
Sciendo
|
Google Scholar
Căruţaşu, Vasile
Jul 05, 2025
International conference KNOWLEDGE-BASED ORGANIZATION
Volume 31 (2025): Issue 3 (June 2025)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Jul 05, 2025
Page range:
31 - 36
DOI:
https://doi.org/10.2478/kbo-2025-0076
Keywords
Latin matrix method
,
Y. Chen’s algorithm
,
Ford-Fulkerson method
,
Hamiltonian paths
© 2025 Vasile Căruţaşu, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
