The complexity of obtaining a distance-balanced graph, 48(2010)

The complexity of obtaining a distance-balanced graph, 48(2010)

Avtor: Sergio Cabello, Primož Lukšič

IMFM preprints

Sergio Cabello, Primož Lukšič: The complexity of obtaining a distance-balanced graph, 48(2010), 48 (2010)

MegaZine3 requires FlashPlayer 9

Get Adobe Flash player

Powered by MegaZine3

0%
0%