|
|
|
|
|
João Paulo Costalonga, Robert J. Kingan and Sandra R. Kingan
A 3-connected graph is minimally 3-connected if removal of any edge destroys 3-connectivity. We present an algorithm for constructing minimally 3-connected graphs based on the results in (Dawes, JCTB 40, 159-168, 1986) using two operations: adding an edg...
ver más
|
|
|
|
|