Title of article
2-Connected Spanning Subgraphs of Planar 3-Connected Graphs
Author/Authors
Barnette، نويسنده , , D.W.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
7
From page
210
To page
216
Abstract
We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15. We give an example of a planar 3-connected graph with no spanning 2-connected subgraph of maximum valence five.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1994
Journal title
Journal of Combinatorial Theory Series B
Record number
1525896
Link To Document