UNIQUENESS OF MAXIMAL DOMINATING CYCLES IN 3-REGULAR GRAPHS AND OF HAMILTONIAN CYCLES IN 4-REGULAR GRAPHS

被引：18

作者：

FLEISCHNER, H

机构：

[1] Institute for Information Processing Austrian, Academy of Sciences, Vienna

来源：

JOURNAL OF GRAPH THEORY | 1994年 / 18卷 / 05期

关键词：

D O I：

10.1002/jgt.3190180503

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We construct 3-regular (cubic) graphs G that have a dominating cycle C such that no other cycle C1 of G satisfies V(C) subset-or-equal-to V(C1). By a similar construction we obtain loopless 4-regular graphs having precisely one hamiltonian cycle. The basis for these constructions are considerations on the uniqueness of a cycle decomposition compatible with a given eulerian trail in some eulerian graph. (C) 1994 John Wiley & Sons, Inc.

引用

页码：449 / 459

页数：11