Decomposing planar cubic graphs

被引：12

作者：

Hoffmann-Ostenhof, Arthur ^{[1
]}

Kaiser, Tomas ^{[2
,3
]}

Ozeki, Kenta ^{[4
]}

机构：

[1] Vienna Univ Technol, Inst Informat Syst, Vienna, Austria

[2] Univ West Bohemia, Dept Math, Inst Theoret Comp Sci CE ITI, Plzen, Czech Republic

[3] Univ West Bohemia, European Ctr Excellence NTIS, Plzen, Czech Republic

[4] Yokohama Natl Univ, Fac Environm & Informat Sci, Yokohama, Kanagawa, Japan

来源：

JOURNAL OF GRAPH THEORY | 2018年 / 88卷 / 04期

基金：

日本学术振兴会; 奥地利科学基金会;

关键词：

cubic graph; decomposition; 3-regular graph; separating cycle; spanning tree;

D O I：

10.1002/jgt.22234

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.

引用

页码：631 / 640

页数：10