Title of article
Connected Spanning Subgraphs of 3-Connected Planar Graphs
Author/Authors
Enomoto، نويسنده , , Hikoe and Iida، نويسنده , , Tadashi and Ota، نويسنده , , Katsuhiro، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
10
From page
314
To page
323
Abstract
We prove that every 3-connected planar graph whose minimum degree is greater than or equal to 4 has a connected [2, 3]-factor.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1996
Journal title
Journal of Combinatorial Theory Series B
Record number
1526193
Link To Document