Kiyoshi Ando. Contractible Edges in a ::::k::::-Connected Graph. In Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu, editors, Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi an, China, November 22-24, 2005, Revised Selected Papers. Volume 4381 of Lecture Notes in Computer Science, pages 10-20, Springer, 2005. [doi]
@inproceedings{Ando05:0,
title = {Contractible Edges in a ::::k::::-Connected Graph},
author = {Kiyoshi Ando},
year = {2005},
doi = {10.1007/978-3-540-70666-3_2},
url = {http://dx.doi.org/10.1007/978-3-540-70666-3_2},
tags = {contracts, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Ando05%3A0},
cites = {0},
citedby = {0},
pages = {10-20},
booktitle = {Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi an, China, November 22-24, 2005, Revised Selected Papers},
editor = {Jin Akiyama and William Y. C. Chen and Mikio Kano and Xueliang Li and Qinglin Yu},
volume = {4381},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-70665-6},
}