On assembly of four-connected graphs Conference Paper

abstract

• Springer-Verlag Berlin Heidelberg 1993. A set of operations on 4-connected graphs is introduced in which only llne addition and vertex splitting are involved. It is shown that every 4-connected graph can be assembled from either the complete graph K5 or the double-axle wheel W42 on four vertices using only these operations, with 4-connectivity preserved.

authors

• Chen, Jianer

published proceedings

• Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

author list (cited authors)

• Chen, J., & Kanevsky, A.

complete list of authors

• Chen, J||Kanevsky, A

publication date

• January 1993

published in

• Lecture Notes in Artificial Intelligence  Journal

International Standard Book Number (ISBN) 13

• 9783540564027

start page

• 158

end page

• 169

volume

• 657 LNCS