Your selections:
On the connectivity of (k, g)-cages of even girth
- Lin, Yuqing, Balbuena, Camino, Marcote, Xavier, Miller, Mirka
A lower bound on the order of regular graphs with given girth pair
- Balbuena, Camino, Jiang, T., Lin, Yuqing, Marcote, Xavier, Miller, Mirka
An open problem : (4; g)-cages with odd g <= 5 are tightly connected
- Tang, Jianmin, Balbuena, Camino, Lin, Yuqing, Miller, Mirka
Diameter-sufficient conditions for a graph to be super-restricted connected
- Balbuena, Camino, Lin, Yuqing, Miller, Mirka
All (k;g)-cages are edge-superconnected
- Lin, Yuqing, Miller, Mirka, Balbuena, Camino, Marcote, Xavier
- Balbuena, Camino, Barker, Ewan, Lin, Yuqing, Miller, Mirka, Sugeng, Kiki Ariyanti
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.
Improved lower bound for the vertex connectivity of (delta;g)-cages
- Lin, Yuqing, Miller, Mirka, Balbuena, Camino
Are you sure you would like to clear your session, including search history and login status?