Title of article :
Connected Spanning Subgraphs of 3-Connected Planar Graphs
Author/Authors :
Enomoto، نويسنده , , Hikoe and Iida، نويسنده , , Tadashi and Ota، نويسنده , , Katsuhiro، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
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
Journal title :
Journal of Combinatorial Theory Series B
