zbMATH — the first resource for mathematics

Generating all graph coverings by permutation voltage assignments. (English) Zbl 0375.55001

57M10 Covering spaces and low-dimensional topology
05C10 Planar graphs; geometric and topological aspects of graph theory
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
Full Text: DOI
[1] Alpert, S.R.; Gross, J.L., Components of branched coverings of a current graph, J. combinatorial theory, 20, 283-303, (1976) · Zbl 0298.05107
[2] Fox, R.H., Covering spaces with singularities, () · Zbl 0288.55011
[3] Gross, J.L., Every regular graph of even degree is a Schreier coset graph, J. combinatorial theory ser B, 22, 227-232, (1977) · Zbl 0369.05042
[4] Gross, J.L., Voltage graphs, Discrete math., 9, 239-246, (1974) · Zbl 0286.05106
[5] Gross, J.L.; Alpert, S.R., The topological theory of current graphs, J. combinatorial theory (B), 17, 218-233, (1974) · Zbl 0298.05106
[6] Gross, J.L.; Tucker, T.W., Quotients of complete graphs; revisiting the heawood map-coloring problem, Pacific J. math., 55, 391-402, (1974) · Zbl 0306.55001
[7] Gustin, W., Orientable imbeddings of Cayley graphs, Bull. amer. math. soc., 49, 272-275, (1963) · Zbl 0118.18805
[8] Jacques, A., Constellations et proprietes algebriques des graphs topologiques, ()
[9] Magnus, W.; Karrass, A.; Solitar, D., Combinatorial group theory, (1966), Interscience Publishers NY
[10] Massey, W.S., Algebraic topology: an introduction, (1967), Harcourt, Brace and World NY · Zbl 0153.24901
[11] Ringel, G.; Youngs, J.W.T., Solution of the heawood map-coloring problem, Proc. natl. acad. sci., 60, 438-445, (1968), USA · Zbl 0155.51201
[12] White, A.T., Graphs, groups, and surfaces, (1973), North-Holland Amsterdam · Zbl 0378.05028
[13] White, A.T., On the genus of a group, Trans. amer. math. soc., 173, 203-214, (1972) · Zbl 0253.05113
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.