Given an edge of a graph , the graph is obtained from by contracting the edge ; that is, to get we identify the vertices and and remove all loops and duplicate edges. A graph obtained by a sequence of edge-contractions is said to be a contraction of .
Adapted with permission of the author from by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.
|Date of creation||2013-03-22 12:31:43|
|Last modified on||2013-03-22 12:31:43|
|Last modified by||rspuzio (6075)|