Up to a double cover, every regular connected graph is isomorphic to a Schreier graph

Paul-Henry Leemann

Up to a double cover, every regular connected graph is isomorphic to a Schreier graph

Department of Pure Mathematics

Research output: Contribution to journal › Article › peer-review

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

Access to Document

https://projecteuclid.org/journals/bulletin-of-the-belgian-mathematical-society-simon-stevin/volume-28/issue-3/Up-to-a-double-cover-every-regular-connected-graph-is/10.36045/j.bbms.210416.short

Cite this

Leemann, P.-H. (2022). Up to a double cover, every regular connected graph is isomorphic to a Schreier graph. Bulletin of the Belgian Mathematical Society - Simon Stevin, 28(3), 373-379. https://projecteuclid.org/journals/bulletin-of-the-belgian-mathematical-society-simon-stevin/volume-28/issue-3/Up-to-a-double-cover-every-regular-connected-graph-is/10.36045/j.bbms.210416.short

@article{423c984449b0408bb9f809130ab3717a,

title = "Up to a double cover, every regular connected graph is isomorphic to a Schreier graph",

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.",

keywords = "Cayley graphs, coverings, perfect matchings, regular graphs, Schreier graphs",

author = "Paul-Henry Leemann",

year = "2022",

month = mar,

language = "English",

volume = "28",

pages = "373--379",

journal = "Bulletin of the Belgian Mathematical Society - Simon Stevin",

issn = "1370-1444",

number = "3",

}

Leemann, P-H 2022, 'Up to a double cover, every regular connected graph is isomorphic to a Schreier graph', Bulletin of the Belgian Mathematical Society - Simon Stevin, vol. 28, no. 3, pp. 373-379. <https://projecteuclid.org/journals/bulletin-of-the-belgian-mathematical-society-simon-stevin/volume-28/issue-3/Up-to-a-double-cover-every-regular-connected-graph-is/10.36045/j.bbms.210416.short>

TY - JOUR

T1 - Up to a double cover, every regular connected graph is isomorphic to a Schreier graph

AU - Leemann, Paul-Henry

PY - 2022/3

Y1 - 2022/3

N2 - 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.

AB - 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.

KW - Cayley graphs

KW - coverings

KW - perfect matchings

KW - regular graphs

KW - Schreier graphs

M3 - Article

SN - 1370-1444

VL - 28

SP - 373

EP - 379

JO - Bulletin of the Belgian Mathematical Society - Simon Stevin

JF - Bulletin of the Belgian Mathematical Society - Simon Stevin

IS - 3

ER -

Up to a double cover, every regular connected graph is isomorphic to a Schreier graph

Abstract

Keywords

Access to Document

Fingerprint

Cite this