Abstract
An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. Some results concerning k-contractible edges in a k-connected graph are presented. © 2007 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Ando, K. (2007). Contractible edges in a k-connected graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4381 LNCS, pp. 10–20). https://doi.org/10.1007/978-3-540-70666-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free