Skip to main content

Graph factors with given properties

Part of the Lecture Notes in Mathematics book series (LNM,volume 1073)

Abstract

We present a sufficient condition for a graph to have a (g,f)-factor which contains p given edges but does not contain other q given edges, where g and f are integer-valued functions defined on the vertices of the graph.

Keywords

  • Regular Graph
  • Discrete Math
  • Incident Edge
  • Disjoint Subset
  • Factor Theorem

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs, Prindle, Weber and Schmidt, Boston MA (1979).

    MATH  Google Scholar 

  2. C. Berge, Theorie des graphes et ses applications, Paris (1958).

    Google Scholar 

  3. J. A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press Ltd, London (1976).

    CrossRef  MATH  Google Scholar 

  4. L. Lovász, Subgraphs with prescribed valencies, J. Comb. Theory 8 (1970), 391–416.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. M. Kano, [a,b]-factorization of a graph, submitted.

    Google Scholar 

  6. M. Kano and A. Saito, [a,b]-factors of graphs, Discrete Math. to appear.

    Google Scholar 

  7. J. Plesnik, Connectivity of regular graphs and the existence of 1-factors, Mathematicky casopis 22 (1972), 310–318.

    MathSciNet  MATH  Google Scholar 

  8. J. Plesnik, Remarks on regular factors of regular graphs, Czech. Math. J. 24 (1974), 292–300.

    MathSciNet  MATH  Google Scholar 

  9. W. T. Tutte, The factors of graphs, Can. J. Math. 4 (1952), 314–328.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. W. T. Tutte, Graph factors, Combinatorica 1 (1981), 79–97.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Kano, M. (1984). Graph factors with given properties. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073114

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13368-1

  • Online ISBN: 978-3-540-38924-8

  • eBook Packages: Springer Book Archive