Back to Search
Start Over
On Critical 3-Connected Graphs with Two Vertices of Degree 3. Part I
- Source :
- Journal of Mathematical Sciences. 236:532-541
- Publication Year :
- 2018
- Publisher :
- Springer Science and Business Media LLC, 2018.
-
Abstract
- A 3-connected graph G is said to be critical if for any vertex υ ∈ V (G) the graph G − υ is not 3-connected. Entringer and Slater proved that any critical 3-connected graph contains at least two vertices of degree 3. In this paper, a classification of critical 3-connected graphs with two vertices of degree 3 is given in the case where these vertices are adjacent. The case of nonadjacent vertices of degree 3 will be studied in the second part of the paper, which will be published later.
Details
- ISSN :
- 15738795 and 10723374
- Volume :
- 236
- Database :
- OpenAIRE
- Journal :
- Journal of Mathematical Sciences
- Accession number :
- edsair.doi...........80e821a63eef8c9c8cd407c6b4acbdfa