Scholarlink

In his famous book on graph theory, König (1936, p. 26) raised the following question: “when is there a cycle in a graph which contains every vertex of the graph? Such a cycle — which can, of course, exist only in the case of connected graphs — shall be called a Hamiltonian cycle”.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

H

  • 章节

  • 发表日期：

    2025年

查看全文
  • Holger Becker

摘要

In his famous book on graph theory, König (1936, p. 26) raised the following question: “when is there a cycle in a graph which contains every vertex of the graph? Such a cycle — which can, of course, exist only in the case of connected graphs — shall be called a Hamiltonian cycle”.