Finding shortest non-separating and non-contractible cycles for topologically embedded graphs, 43(2005)

Finding shortest non-separating and non-contractible cycles for topologically embedded graphs, 43(2005)

Avtor: Sergio Cabello, Bojan Mohar

Več o projektu...

IMFM preprints

Sergio Cabello, Bojan Mohar: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs, 43(2005), 43 (2005)

MegaZine3 requires FlashPlayer 9

Get Adobe Flash player

Powered by MegaZine3

Išči
0%
0%