𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a property of cyclic covers of p-graphs

✍ Scribed by Themistocles Politof

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
177 KB
Volume
18
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

A directed graph G with a source s and a sink r is called a p-graph if every edge of G belongs to an elementary (s,r)-path of G. If C is a cycle of the p-graph G then a cyclic cover of C is a set of (s,r)-paths of G that contains all the edges of C. A cyclic cover Q is minimal if for

πŸ“œ SIMILAR VOLUMES

A note on shortest cycle covers of cubic
A note on shortest cycle covers of cubic graphs
✍ Xinmin Hou; Cun-Quan Zhang πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 92 KB πŸ‘ 1 views

## Abstract Let __SCC__~3~(__G__) be the length of a shortest 3‐cycle cover of a bridgeless cubic graph __G__. It is proved in this note that if __G__ contains no circuit of length 5 (an improvement of Jackson's (__JCTB 1994__) result: if __G__ has girth at least 7) and if all 5‐circuits of __G_

On an adjacency property of graphs
On an adjacency property of graphs
✍ Geoffrey Exoo πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 374 KB

## Abstract A graph __G__ has property __A(m, n, k)__ if for any sequence of __m__ + __n__ distinct points of __G__, there are at least __k__ other points, each of which is adjacent to the first __m__ points of the sequence but not adjacent to any of the latter __n__ points. the minimum order among

On 2-Arc-Transitive Covers of Complete G
On 2-Arc-Transitive Covers of Complete Graphs
✍ Shao-fei Du; Dragan MaruΕ‘ič; Adrian O Waller πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 282 KB

Regular covers of complete graphs which are 2-arc-transitive are investigated. A classification is given of all such graphs whose group of covering transformations is either cyclic or isomorphic to Z p \_Z p , where p is a prime and whose fibrepreserving subgroup of automorphisms acts 2-arc-transiti

A note on coverings of plane graphs
A note on coverings of plane graphs
✍ Eduardo Rivera-Campo πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 175 KB πŸ‘ 1 views

## Abstract For any plane graph __G__ the number of edges in a minimum edge covering of the faces of __G__ is at most the vertex independence number of __G__ and the numbre of vertices in a minimum vertex covering of the faces of __G__ is at most the edge independence number of __G__. Β© 1995 John W

A note on the cover degeneracy of graphs
A note on the cover degeneracy of graphs
✍ Li Zhang; Baoyindureng Wu πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 1 views

## Abstract We give a 4‐chromatic planar graph, which admits a vertex partition into three parts such that the union of every two of them induces a forest. This solves a problem posed by BΓΆhme. Also, by constructing an infinite sequence of graphs, we show that the cover degeneracy can be arbitraril