✦ LIBER ✦

m_Path Cover Saturated Graphs

✍ Scribed by Aneta Dudek; Gyula Y. Katona; A.Pawel Wojda

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 258 KB
Volume: 13
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00434-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path covers of weighted graphs

✍ Genghua Fan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Let (G, w ) denote a simple graph G with a weight function w : €(G) -{0,1,2}. A path cover of (G, w ) is a collection of paths in G such that every edge e is contained in exactly w(e) paths of the collection. For a vertex u , w ( v ) is the sum of the weights of the edges incident with U ; U is call

Perfect path double covers of graphs

✍ J. A. Bondy 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB

## Abstract A __perfect path double cover__ (PPDC) of a graph __G__ on __n__ vertices is a family 𝒫 of __n__ paths of __G__ such that each edge of __G__ belongs to exactly two members of 𝒫 and each vertex of __G__ occurs exactly twice as an end of a path of 𝒫. We propose and study the conjecture th

Optimal path cover problem on block grap

Optimal path cover problem on block graphs

✍ Wong Pak-Ken 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Let G = (V,E) be a block graph. First we show that an algorithm for finding the path partition number p(G) by J.H. Yan and G.J. Chang gives wrong answers to some block graphs. Then we present an efficient algorithm for finding a minimum path partition of G (not just the path partition number p(G)).

Optimal path cover problem on block grap

Optimal path cover problem on block graphs and bipartite permutation graphs

✍ R. Srikant; Ravi Sundaram; Karan Sher Singh; C. Pandu Rangan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Perfect path double covers in every simp

Perfect path double covers in every simple graph

✍ Hao Li 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

## Abstract 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 c

Cardinality constrained path covering pr

Cardinality constrained path covering problems in grid graphs

✍ N. Apollonio; L. Caccetta; B. Simeone 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB