Contractible circuits in 3-connected graphs Original Research Article
Author/Authors :
D.W. Barnette، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Pages :
11
From page :
19
To page :
29
Abstract :
We show that any 3-connected graph other than K4 or K5 contains a contractible circuit or contains one of two simple configurations. This leads to a new recursive construction of the 3-connected graphs.
