Your selections:
Diameter-sufficient conditions for a graph to be super-restricted connected
- Balbuena, Camino, Lin, Yuqing, Miller, Mirka
Divisibility conditions in almost Moore digraphs with selfrepeats
- Teska, Jakub, Kuzel, Roman, Miller, Mirka
Hybrid simulated annealing and genetic algorithm for degree/diameter problem
- Tang, Jianmin, Miller, Mirka, Lin, Yuqing
Open problems in the construction of large directed graphs
- Dafik, Miller, Mirka, Ryan, Joe, Slamin,
Two new families of large compound graphs
- Marti, J. Gomez, Miller, Mirka
Are you sure you would like to clear your session, including search history and login status?