Skip to main content
Log in

A New Result on Alspach's Problem

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

Let G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(G) with g(x)≥2 and f(x)≥5 for all xV(G). It is proved that if G is an (mg+m−1, mfm+1)-graph and H is a subgraph of G with m edges, then there exists a (g,f)-factorization of G orthogonal to H.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: January 19, 1996 Revised: November 11, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yan, G. A New Result on Alspach's Problem. Graphs Comb 15, 365–371 (1999). https://doi.org/10.1007/s003730050070

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050070

Keywords

Navigation