Up to a double cover, every regular connected graph is isomorphic to a Schreier graph (Q2135300): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.36045/j.bbms.210416 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.36045/J.BBMS.210416 / rank | |||
Normal rank | |||
Latest revision as of 04:43, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Up to a double cover, every regular connected graph is isomorphic to a Schreier graph |
scientific article |
Statements
Up to a double cover, every regular connected graph is isomorphic to a Schreier graph (English)
0 references
6 May 2022
0 references
Cayley graphs
0 references
coverings
0 references
perfect matchings
0 references
regular graphs
0 references
Schreier graphs
0 references
0 references
0 references
