Skip to main content
SpringerLink
Log in

On Graphs with Degrees in Prescribed Intervals

  • Conference paper
Algebraic Combinatorics and Applications

  • 471 Accesses

Abstract

Necessary and sufficient conditions are given for the existence of graphs and bipartite graphs with degrees in prescribed intervals.

Dedicated to Adalbert Kerber on the occasion of his 60th birthday.

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. EG60] P. Erdös and T. Gallai, Graphs with given degree of vertices (Hungarian).

    Google Scholar 

  2. Mat. Lapok, 11:264–274, 1960.

    Google Scholar 

  3. Ful59] D. R. Fulkerson, A Network-Flow Feasibility Theorem and Combinatorial

    Google Scholar 

  4. Applications. Canadian J. Math., 11: 4404–451, 1959.

    Google Scholar 

  5. D. Gale, A Theorem on Flows in Networks. Pacific J. Math., 7: 10734–1082, 1957.

    Article  MathSciNet  Google Scholar 

  6. M. Koren, Graphs with Degrees from Prescribed Intervals. Discrete Math., 15: 2534–261, 1976.

    Article  MathSciNet  Google Scholar 

  7. M. Krause (=M. Schocker), A simple proof of the Gale­Ryser theorem. American Mathematical Monthly, 103, no. 4: 3354–337, 1996.

    Article  Google Scholar 

  8. H.J. Ryser, Combinatorial properties of matrices of zeros and ones. Canadian J. Math., 9: 3714–377, 1957.

    Article  MathSciNet  Google Scholar 

  9. M. Schocker, Uber Graphen mit vorgegebenen Valenzen. Abh. des Math. Sem. der Univ. Hamburg, 69: 2654–270, 1999.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Seminar der Universität, Ludewig-Meyn-Str. 4, 24098, Kiel, Germany

    Manfred Schocker

Authors
  1. Manfred Schocker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl II für Mathematik, Universität Bayreuth, 95440, Bayreuth, Germany

    Anton Betten , Axel Kohnert , Reinhard Laue  & Alfred Wassermann , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schocker, M. (2001). On Graphs with Degrees in Prescribed Intervals. In: Betten, A., Kohnert, A., Laue, R., Wassermann, A. (eds) Algebraic Combinatorics and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59448-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59448-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41110-9

  • Online ISBN: 978-3-642-59448-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation