✦ LIBER ✦

Path Coverings of Graphs and Height Characteristics of Matrices

✍ Scribed by D. Hershkowitz; H. Schneider

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 623 KB
Volume: 59
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1063

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

The height characteristic of block trian

The height characteristic of block triangular matrices

✍ Daniel Hershkowitz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Characteristic polynomials of some graph

Characteristic polynomials of some graph coverings

✍ Hirobumi Mizuno; Iwao Sato 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Cycle and cocycle coverings of graphs

✍ Sean McGuinness 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

In this article, we show that for any simple, bridgeless graph G on n vertices, there is a family C of at most n-1 cycles which cover the edges of G at least twice. A similar, dual result is also proven for cocycles namely: for any loopless graph G on n vertices and edges having cogirth g \* ≥ 3 and

Packings and perfect path double covers

Packings and perfect path double covers of maximal planar graphs

✍ Karen Seyffarth 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 817 KB

Seyffarth, K., Packings and perfect path double covers of maximal planar graphs, Discrete Mathematics 117 (1993) 1833195. A maximal planar graph is a simple planar graph in which every face is a triangle, and a perfect packing of such a graph by 2-cliques and facial triangles corresponds to a parti