|
 |
[2] ai.viXra.org:2508.0016 [pdf] submitted on 2025-08-07 04:37:21
Authors: Liang Chen
Comments: 8 Pages.
The algorithm in this paper is primarily designed to identify a Hamiltonian cycle in graphs confirmed to contain one. The core idea involves removing redundant edges while preserving essential ones; the remaining edges after deletion form the Hamiltonian cycle. The algorithm’s greatest advantage is that it requires no backtracking.
Category: Combinatorics and Graph Theory
[1] ai.viXra.org:2508.0015 [pdf] submitted on 2025-08-07 04:41:43
Authors: Liang Chen
Comments: 7 Pages.
In this paper, only two graphs with identical initial degree sequences are compared, as graphs with different degree sequences can be easily distinguished through simple traversal, rendering further discussion unnecessary.The core idea of this paper is reverse thinking: if two graphs are identical, they can be constructed step-by-step in the same manner, and they can also be deconstructed stepby-step in the same manner, with each deconstruction step producing identical intermediate results.
Category: Combinatorics and Graph Theory