𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on Counting Connected Graph Covering Projections

✍ Scribed by Hofmeister, Michael

Book ID
118198119
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
240 KB
Volume
11
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering the Edges of a Connected Graph
Covering the Edges of a Connected Graph by Paths
✍ L. Pyber πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 316 KB

We prove that every connected graph on n vertices can be covered by at most nΓ‚2+O(n 3Γ‚4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.

Note on projective graphs
Note on projective graphs
✍ Tomasz Łuczak; Jaroslav NeΕ‘etΕ™il πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 69 KB

## Abstract We show that all graphs with a simple extension property are projective. As a consequence of this result we settle in the affirmative a conjecture of Larose and Tardif and characterize all homogeneous graphs which are projective. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 47: 81–86,

A note on Winkler's algorithm for factor
A note on Winkler's algorithm for factoring a connected graph
✍ Bernhard Hochstrasser πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 529 KB

Hochstrasser, B., A note on Winkler's algorithm for factoring a connected graph, Discrete Mathematics 109 (1992) 127-132. Let the connected graph G be canonically embedded into a Cartesian product fl,,, CF. We improve a method of Winkler (1987) for partitioning I in a way suitable for finding the un