Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

(g,f)-Factorizations of graphs orthogonal to [1,2]-subgraph

(g,f)-Factorizations of graphs orthogonal to [1,2]-subgraph LetG be a simple graph. Letg(x) andf(x) be integer-valued functions defined onV(G) withf(x)≥g(x)≥1 for allxεV(G). It is proved that ifG is an (mg+m−1,mf−m+1)-graph andH is a [1,2]-subgraph withm edges, then there exists a (g,f)-factorization ofG orthogonal toH. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

(g,f)-Factorizations of graphs orthogonal to [1,2]-subgraph

Acta Mathematicae Applicatae Sinica , Volume 13 (4) – Jul 13, 2005

Loading next page...
 
/lp/springer-journals/g-f-factorizations-of-graphs-orthogonal-to-1-2-subgraph-aRqfKwp6pI
Publisher
Springer Journals
Copyright
Copyright © 1997 by Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02009545
Publisher site
See Article on Publisher Site

Abstract

LetG be a simple graph. Letg(x) andf(x) be integer-valued functions defined onV(G) withf(x)≥g(x)≥1 for allxεV(G). It is proved that ifG is an (mg+m−1,mf−m+1)-graph andH is a [1,2]-subgraph withm edges, then there exists a (g,f)-factorization ofG orthogonal toH.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 13, 2005

References