On 2-regular subgraphs in polyhedral graphs

被引：0

作者：

Göring, F ^{[1
]}

机构：

[1] Tech Univ Ilmenau, Dept Math, D-98684 Ilmenau, Germany

来源：

DISCRETE MATHEMATICS | 2002年 / 251卷 / 1-3期

关键词：

polyhedral graph; domination; cycle;

D O I：

10.1016/S0012-365X(01)00329-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that every polyhedral graph G contains a 2-regular subgraph U such that G - U is a forest of trees with at most three leaves. With this tool we give a partial solution of a problem posed in a problem session at the Workshop "Cycles and Colourings '98" in Stara Lesna, Slovakia. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：97 / 102

页数：6

共 8 条

[1]

BOHME T, COMMUNICATION

[2]

BONSMA P, COMMUNICATION

[3]

Diestel R., 1997, Graduate Texts in Mathematics, V173

[4] Convex programming and circumference of 3-connected graphs of low genus [J].

Gao, ZC ;

Yu, XX .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 69 (01) :39-51

[5]

HARANT J, CYCLES COLOURINGS 98

[6] 4-CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN [J].

THOMAS, R ;

YU, XX .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 62 (01) :114-132

[7] A THEOREM ON PATHS IN PLANAR GRAPHS [J].

THOMASSEN, C .

JOURNAL OF GRAPH THEORY, 1983, 7 (02) :169-176

[8]

Tutte W. T., 1956, Trans. Am. Math. Soc., V82, P99, DOI DOI 10.1090/S0002-9947-1956-0081471-8

← 1 →