Orthogonal factorizations of graphs

被引：14

作者：

Feng, HD ^{[1
]}

Liu, GZ

机构：

[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China

[2] Shandong Univ, Dept Syst Sci & Math, Jinan 250100, Peoples R China

来源：

JOURNAL OF GRAPH THEORY | 2002年 / 40卷 / 04期

关键词：

graph; factor; orthogonal factorization;

D O I：

10.1002/jgt.10048

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a graph with vertex set V(G) and edge set E(G). Let k(1), k(2),...,k(m) be positive integers. It is proved in this study that every [0,k(1) + ... + k(m) - m+1]-graph G has a [0,k(i)](1)(m)-factorization orthogonal to any given subgraph H with m edges. (C) 2002 Wiley Periodicals, Inc.

引用

页码：267 / 276

页数：10

共 10 条

[1]

ALSPACH B, 1992, CONT DESIGN THEORY C, P13

[2]

Bondy J.A., 2008, GRAD TEXTS MATH

[3]

FENG H, 1998, J ADV MATH, V27, P184

[4] ON THE EXISTENCE OF A MATCHING ORTHOGONAL TO A 2-FACTORIZATION [J].

KOUIDER, M ;

SOTTEAU, D .

DISCRETE MATHEMATICS, 1989, 73 (03) :301-304

[5] (g,f)-factorizations orthogonal to a subgraph in graphs [J].

Li, GJ ;

Liu, GZ .

SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 1998, 41 (03) :267-272

[6]

LIU G, 1992, J ADV MATH, V21, P211

[7]

LIU G, 1995, J SCI CHINA A, V25, P367

[8] ORTHOGONAL (G,F)-FACTORIZATIONS IN GRAPHS [J].

LIU, GZ .

DISCRETE MATHEMATICS, 1995, 143 (1-3) :153-158

[9]

Lovasz L, 1970, J COMB THEORY, V8, P319

[10]

Plummer MichaelD., 1986, Matching theory, V29

← 1 →