Abstract
We prove that every connected locally finite regular graph is either isomorphic to a Schreier graph, or has a double cover which is isomorphic to a Schreier graph.
| Original language | English |
|---|---|
| Pages (from-to) | 373-379 |
| Journal | Bulletin of the Belgian Mathematical Society - Simon Stevin |
| Volume | 28 |
| Issue number | 3 |
| Publication status | Published - Mar 2022 |
Keywords
- Cayley graphs
- coverings
- perfect matchings
- regular graphs
- Schreier graphs
Fingerprint
Dive into the research topics of 'Up to a double cover, every regular connected graph is isomorphic to a Schreier graph'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver