Up to a double cover, every regular connected graph is isomorphic to a Schreier graph (Q2135300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.36045/j.bbms.210416 / rank
Normal rank
 
Property / cites work
 
Property / cites work: König's Duality Theorem for Infinite Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite digraphs with given regular automorphism groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ihara zeta function of infinite graphs, the KNS spectral measure and integrable maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every connected regular graph of even degree is a Schreier coset graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schreir graphs: Transitivity and coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Fixed-Point-Free Graphs / rank
 
Normal 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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references