Generation of All Hamiltonian Cycles in a Plane Graph

Lu Sheng-xun

您当前的位置：

首页 >

文章列表页 >

Generation of All Hamiltonian Cycles in a Plane Graph

更新时间：2025-12-08

- Generation of All Hamiltonian Cycles in a Plane Graph
- Acta Electronica Sinica Issue 1, Pages: 29-36(1980)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1980
- 稿件说明：
移动端阅览
[1]陆生勋.平面化图的哈密顿圈的产生[J].电子学报,1980(01):29-36.

Lu Sheng-xun. Generation of All Hamiltonian Cycles in a Plane Graph[J]. Acta Electronica Sinica, 1980, (1): 29-36.
[1]陆生勋.平面化图的哈密顿圈的产生[J].电子学报,1980(01):29-36. DOI：

Lu Sheng-xun. Generation of All Hamiltonian Cycles in a Plane Graph[J]. Acta Electronica Sinica, 1980, (1): 29-36. DOI：

摘要

本文提出如何利用修正的王氏积产生平面化图的全部哈密顿圈。这种方法较以前的计算简单得多。它的计算步骤在文中以举例的方式作了说明。为了保证算法的正确

导出了一个2-树是2-顶点树的充要条件。

Abstract

This paper is to show how a modified Wang product can be used to generate all the Hamil-tonian cycles in a plane graph with considerably less computation than previousely reported. The method is explained in detail with examples. To assure correct algorithm a necessary and sufficient condition for a 2-tree to be a vertex 2-tree is derived. A vertex graph is said to be a vertex 2-tree

if it has 2-com-ponents and contains no cycles.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰