Premium
Perfect path double covers in every simple graph
Author(s) -
Li Hao
Publication year - 1990
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190140604
Subject(s) - mathematics , combinatorics , vertex (graph theory) , path (computing) , graph , simple (philosophy) , induced path , discrete mathematics , shortest path problem , longest path problem , computer science , philosophy , epistemology , programming language
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.