Decomposition of some planar graphs into trees

被引：1

作者：

Petrovic, V ^{[1
]}

机构：

[1] UNIV NOVI SAD, INST MATH, YU-21000 NOVI SAD, YUGOSLAVIA

来源：

DISCRETE MATHEMATICS | 1996年 / 150卷 / 1-3期

关键词：

decomposition; planar graph; tree;

D O I：

10.1016/0012-365X(95)00214-H

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that each simple planar graph G whose all faces are quadrilaterals can be decomposed into two disjoint trees T-r and T-b such that V(T-r) = V(G - u) and V(T-b) = V(G - v) for any two non-adjacent vertices u and v of G.

引用

页码：449 / 451

页数：3