The complexity of obtaining a distance-balanced graph.
Cabello, Sergio ; Lukšič, Primož
The Electronic Journal of Combinatorics [electronic only], Tome 18 (2011), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2011-01-01
EUDML-ID : urn:eudml:doc:230327 
@article{05902979,
     title = {The complexity of obtaining a distance-balanced graph.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {18},
     year = {2011},
     zbl = {1218.05043},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05902979}
}

Cabello, Sergio; Lukšič, Primož. The complexity of obtaining a distance-balanced graph.. The Electronic Journal of Combinatorics [electronic only], Tome 18 (2011) . http://gdmltest.u-ga.fr/item/05902979/