Covering Regular Graphs
- 1 September 1997
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 71 (1) , 1-16
- https://doi.org/10.1006/jctb.1996.1743
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Complexity of graph covering problemsPublished by Springer Nature ,1995
- Coverings and Minors: Application to Local Computations in GraphsEuropean Journal of Combinatorics, 1994
- Isomorphisms and automorphisms of graph coveringsDiscrete Mathematics, 1991
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- Homological Coverings of GraphsJournal of the London Mathematical Society, 1984
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Finite common coverings of pairs of regular graphsJournal of Combinatorial Theory, Series B, 1981
- Local and global properties in networks of processors (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1980
- Generating all graph coverings by permutation voltage assignmentsDiscrete Mathematics, 1977
- Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)Canadian Journal of Mathematics, 1973