- 查看更多前往 Wikipedia 查看全部内容
Hamiltonian path | Wikipedia
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle that visits each vertex exactly once. A Hamiltonian path that starts and ends at adjacent vertices can … 展开
Any Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its edges, but a Hamiltonian path can be extended to a Hamiltonian cycle only if its endpoints are adjacent. 展开
An algebraic representation of the Hamiltonian cycles of a given weighted digraph (whose arcs are assigned weights from a certain ground field) is the Hamiltonian cycle polynomial of its weighted adjacency matrix defined as the sum of the products of … 展开
• A complete graph with more than two vertices is Hamiltonian
• Every cycle graph is Hamiltonian
• Every tournament has an odd number of Hamiltonian paths (Rédei 1934)
• Every platonic solid, considered as a graph, is Hamiltonian 展开• Barnette's conjecture, an open problem on Hamiltonicity of cubic bipartite polyhedral graphs
• Eulerian path, a path through all edges in a graph
• Fleischner's theorem, on Hamiltonian squares of graphs 展开CC-BY-SA 许可证中的维基百科文本 哈密顿路径问题 | 维基百科,自由的百科全书
Hamiltonian path problem | Wikipedia
哈密頓路徑 | 维基百科,自由的百科全书
哈密顿路径 - 维基百科,自由的百科全书 | zh.wikipedia.org
图中的特殊路径:哈密顿路径和欧拉路径 | 知乎
网页欧拉路径是访问图中的每条边一次的 迹 (并不符合严格的path定义),也可以称为生成迹(spanning trail)。 欧拉回路就是在同一 顶点 开始和结束的欧拉路径。 欧拉图:具有欧拉回路的图. 半欧拉图:具有欧拉路径但不具 …
Hamiltonian path | Simple English Wikipedia, the free encyclopedia
Hamiltonian Path | Brilliant Math & Science Wiki
网页A Hamiltonian path is a traversal of a (finite) graph that touches each vertex exactly once. If the start and end of the path are neighbors (i.e. share a common edge), the path can be extended to a cycle called a …
Hamiltonian path problem | WikiMili, The Best Wikipedia Reader
Hamiltonian path problem | Wikipedia