Your selections:
Calculating the extremal number ex (v ; {C3, C4, ..., Cn})
- Tang, Jianmin, Lin, Yuqing, Miller, Mirka
Characterization of eccentric digraphs
- Gimbert, Joan, Lopez, Nacho, Miller, Mirka, Ryan, Joe
- Balbuena, Camino, Barker, Ewan, Lin, Yuqing, Miller, Mirka, Sugeng, Kiki Ariyanti
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
- Baca, Martin, Lin, Yuqing, Miller, Mirka, Youssef, Maged
Enumerations of vertex orders of almost Moore digraphs with selfrepeats
- Baskoro, Edy, Cholily, Yus Mochamad, Miller, Mirka
Graphs of order two less than the Moore bound
- Miller, Mirka, Simanjuntak, Rinovia
HSAGA and its application for the construction of near-Moore digraphs
- Tang, Jianmin, Miller, Mirka, Lin, Yuqing
Improved lower bound for the vertex connectivity of (delta;g)-cages
- Lin, Yuqing, Miller, Mirka, Balbuena, Camino
Moore bound for mixed networks
- Nguyen, Minh Hoang, Miller, Mirka
- Fiol, M. A., Gimbert, Joan, Miller, Mirka
New largest graphs of diameter 6. (Extended Abstract)
- Pineda-Villavicencio, Guillermo, Gomez, Jose, Miller, Mirka, Pérez-Rosés, Hebert
On bipartite graphs of defect 2
- Delorme, Charles, Jorgensen, Leif, Miller, Mirka, Pineda-Villavicencio, Guillermo
On consecutive edge magic total labeling of graphs
- Sugeng, Kiki Ariyanti, Miller, Mirka
On irregular total labellings
- Baca, Martin, Jendrol, Stanislav, Miller, Mirka, Ryan, Joe
- Nguyen, Minh Hoang, Miller, Mirka, Gimbert, Joan
On the connectivity of (k, g)-cages of even girth
- Lin, Yuqing, Balbuena, Camino, Marcote, Xavier, Miller, Mirka
On the degrees of a strongly vertex-magic graph
- Balbuena, Camino, Barker, Ewan, Das, K. C., Lin, Yuqing, Miller, Mirka, Ryan, Joe, Slamin,, Sugeng, Kiki Ariyanti, Tkac, M.
- Iliopoulos, Costas, Miller, Mirka
Are you sure you would like to clear your session, including search history and login status?