Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website
@article{JGAA_2009_13_2_a10, author = {Angela Mestre}, title = {Generating connected and 2-edge connected graphs}, journal = {Journal of Graph Algorithms and Applications}, pages = {251--281}, publisher = {mathdoc}, volume = {13}, number = {2}, year = {2009}, doi = {10.7155/jgaa.00187}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00187/} }
TY - JOUR AU - Angela Mestre TI - Generating connected and 2-edge connected graphs JO - Journal of Graph Algorithms and Applications PY - 2009 SP - 251 EP - 281 VL - 13 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00187/ DO - 10.7155/jgaa.00187 LA - en ID - JGAA_2009_13_2_a10 ER -
Angela Mestre. Generating connected and 2-edge connected graphs. Journal of Graph Algorithms and Applications, Tome 13 (2009) no. 2, pp. 251-281. doi : 10.7155/jgaa.00187. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00187/
Cité par Sources :