Characteristics of (γ,3)-critical graphs
Doost Ali Mojdeh, P.Y. Firoozi · Applicable Analysis and Discrete Mathematics · 2010
In this note the (?,3)-critical graphs are fairly classified. We show that a (?,k)- critical graph is not necessarily a (?,k?)-critical for k?? k and k,k? E {1,2,3}. The (2,3)-critical graphs are definitely characterized. Also the properties of (?,3)-critical graphs are verified once their edge connectivity are 3.