PERFECT PATH DOUBLE COVERS IN EVERY SIMPLE GRAPH

被引：17

作者：

LI, H ^{[1
]}

机构：

[1] CHINESE ACAD SCI,INST SYST SCI,BEIJING,PEOPLES R CHINA

来源：

JOURNAL OF GRAPH THEORY | 1990年 / 14卷 / 06期

关键词：

D O I：

10.1002/jgt.3190140604

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove in this paper that every simple graph G admits a perfect path double cover (PPDC), i.e., a set of paths of G such that each edge of G belongs to exactly two of the paths and each vertex of G is an end of exactly two of the paths, where a path of length zero is considered to have (identical) ends. This was conjectured by A. Bondy in 1988. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company

引用

页码：645 / 650

页数：6