Funder
European Science Foundation
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. On the complexity and combinatorics of covering finite complexes;Abello;Australas. J. Combin.,1991
2. Perfect state transfer on quotient graphs;Bachman;Quantum Inf. Comput.,2012
3. Product graph representations;Feder;J. Graph Theory,1992
4. A polynomial time algorithm for finding the prime factors of Cartesian-product graphs;Feigenbaum;Discrete Appl. Math.,1985
5. Equitable partitions into spanning trees in a graph;Fekete;Electron. J. Combin.,2011
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献