Finite common coverings of graphs
โ Scribed by Frank Thomson Leighton
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 414 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Galois theory for normal unramified coverings of finite irregular graphs (which may have multiedges and loops) is developed. Using Galois theory we provide a construction of intermediate coverings which generalizes the classical Cayley and Schreier graph constructions. Three different analogues of A
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