Skip to main content
SpringerLink
Log in

Extensible algorithms

  • Section II: Algorithms
  • Conference paper
  • First Online:
Logic and Machines: Decision Problems and Complexity (LaM 1983)

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

Included in the following conference series:

  • 165 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bean, D.R., Recursive Euler and Hamilton paths, Proceedings of the American Mathematical Society, 55 (1976), 385–394.

    Google Scholar 

  2. Carstens, H.-G., Recursive colorings on surfaces, to appear.

    Google Scholar 

  3. Carstens, H.-G., Päppinghaus, P., Recursive coloration of countable graphs, Annals of Pure and Applied Logic 25 (1983), 19–45.

    Google Scholar 

  4. Carstens, H.-G., Päppinghaus, P., Abstract construction of counterexamples in recursive graph theory, to appear.

    Google Scholar 

  5. Ford, L.R., Fulkerson, D.R., Flows in networks, Princeton University Press, N.J., 1962.

    Google Scholar 

  6. Harary, F., Graph Theory, Reading (Mass.), 1969.

    Google Scholar 

  7. Kierstead, H.A., Recursive colorings of highly recursive graphs, Canadian Journal of Mathematics, 33 (1981), 1279–1290.

    Google Scholar 

  8. Manaster, A.B., Rosenstein, J.G., Effective match making (Recursion theoretic aspects of a theorem of Phillip Hall), Proceedings of the London Mathematical Society, 25 (1972), 615–645.

    Google Scholar 

  9. Manaster, A.B., Rosenstein, J.G., Effective match making and k-chromatic graphs, Proceedings of the American Mathematical Society, 39 (1973), 371–379.

    Google Scholar 

  10. Schmerl, J.H., Recursive colorings of graphs, Canadian Journal of Mathematics, 32 (1980), 821–830.

    Google Scholar 

  11. Schmerl, J.H., The effective version of Brook's theorem, Canadian Journal of Mathematics, 34 (1982), 1036–1046.

    Google Scholar 

  12. Shoenfield, J.R., Mathematical Logic, Reading (Mass.), 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Bielefeld, Universitätsstr. 1, D-4800, Bielefeld, Fed. Rep. of Germany

    Hans-Georg Carstens & Peter Päppinghaus

  2. Institute of Mathematics, University of Hannover, Welfengarten 1, D-3000, Hannover, Fed. Rep. of Germany

    Hans-Georg Carstens & Peter Päppinghaus

Authors
  1. Hans-Georg Carstens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Päppinghaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carstens, HG., Päppinghaus, P. (1984). Extensible algorithms. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation