Skip to main content
SpringerLink
Log in

(g, f)-Factorizations Orthogonal to k Subgraphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2204))

Included in the following conference series:

Abstract

We establish two results for (g, f)-factorizations:

  1. 1.

    every (mg + m − 1, mf − m + 1 )—graph with 9k/4 ≤ g ≤ f has a (g, f)—factorization orthogonal to any set of k given edge disjoint m—subgraphs of G;

  2. 2.

    every (0, mf — m + 1)—graph G with f ≤ k + 2 has a (0, f)—factorization orthogonal to any set of k given vertex disjoint m—subgraphs of G. Polynomial-time algorithms to find the claimed orthogonal factorizations under the above conditions are presented.

Research is partially supported by a grant from the Research Grants Council of Hong Kong SAR (CityU 1074/00E) and a grant from CityU of Hong Kong (Project No.7001215).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Alspach, K. Heinrich, G.Z. Liu: Contemporary Design Theory—A collection of surveys. John Wiley and Sons, New York (1992) 13–37

    Google Scholar 

  2. R.P. Anstee: An algorithm proof of Tutte’s f-factor theorem. J ALg 6(1985) 112–131

    Article  MATH  MathSciNet  Google Scholar 

  3. J.A. Bondy, U.S.R. Murty: Graph Theory with Applications. Elsevier-North Holland, New York (1976)

    Google Scholar 

  4. K. Heinrich, P. Hell, D.G. Kirkpatrick, G.Z. Liu: A simple existence criterion for (g < f)-factors. Discrete Math. 85(3)(1990) 313–317

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Hell, D.G. Kirkpatrick: Algorithms for degree constrained graph factors of minimum deficiency. J. Algorithms 14(1)(1993)115–138

    Article  MATH  MathSciNet  Google Scholar 

  6. P.C.B. Lam, G.Z. Liu, G.J. Li, W.C. Shiu: Orthogonal (g, f)-Factorizations in Networks. NetWorks 35(4) (2000) 274–278

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of HongKong, Hong Kong

    Haodi Feng

Authors
  1. Haodi Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rostock, 18051, Rostock, Germany

    Andreas Brandstädt  & Van Bang Le  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feng, H. (2001). (g, f)-Factorizations Orthogonal to k Subgraphs. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45477-2_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42707-0

  • Online ISBN: 978-3-540-45477-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation