Document Type

Journal Article

Department/Unit

Department of Mathematics

Abstract

Let G = (V, E) be a graph and let g and f be two integer-valued functions defined on V such that kg(x) ≤ f(x) for all xV. LetH1, H2, …, Hk be subgraphs of G such that |E(Hi)| = m, 1 ≤ ik, and V(Hi) ∩ V(Hj) = 0 when ij. In this paper, it is proved that every (mg + m − 1, mfm + 1)-graph G has a (g, f)-factorization orthogonal to Hi for i = 1, 2, …, k and shown that there are polynomial-time algorithms to find the desired (g, f)-factorizations.

Publication Year

2000

Journal Title

Networks

Volume number

35

Issue number

4

Publisher

Wiley

First Page (page number)

274

Last Page (page number)

278

Referreed

1

DOI

10.1002/1097-0037(200007)35:4<274::AID-NET6>3.0.CO;2-6

ISSN (print)

10970037

Keywords

network, graph, (g, f)-factorization, orthogonal factorization

Included in

Mathematics Commons

Share

COinS