Generating all graph coverings by permutation voltage assignments
Authors:
- Jonathan L. GrossJGJonathan L. Gross
- Thomas W. TuckerTTThomas W. Tucker
- 1 January 1977
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 18 (3) , 273-283
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Every connected regular graph of even degree is a Schreier coset graphJournal of Combinatorial Theory, Series B, 1977
- Components of branched coverings of current graphsJournal of Combinatorial Theory, Series B, 1976
- The topological theory of current graphsJournal of Combinatorial Theory, Series B, 1974
- Quotients of complete graphs: revisiting the Heawood map-coloring problemPacific Journal of Mathematics, 1974
- Voltage graphsDiscrete Mathematics, 1974
- On the genus of a groupTransactions of the American Mathematical Society, 1972
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEMProceedings of the National Academy of Sciences, 1968
- Orientable embedding of Cayley graphsBulletin of the American Mathematical Society, 1963