Skip to main content
SpringerLink
Log in

On a search problem in graph theory

  • Conference paper
  • First Online:
Optimization

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

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
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. Aigner, M., Combinatorial search, Wiley-Teubner, 1988.

    Google Scholar 

  2. Aigner, M., Triesch, E., Wearching for an edge in a graph, J. Graph Theory, 12, 1988, 45–57.

    Article  MathSciNet  MATH  Google Scholar 

  3. Best, M.R., van Emde Boas, P. and Lenstra, Jr. H.W., A sharpened version of the Aanderaa-Rosenberg conjecture, Math. Centrum, Amsterdam, 1974.

    MATH  Google Scholar 

  4. Bollobas, B., Extremal graph theory, Academic Press, 1978.

    Google Scholar 

  5. Harary, F., Graph theory, Addison-Wesley, 1969.

    Google Scholar 

  6. Kleitman, D.J., Kwiatkowski, D.J., Further results on the Aanderaa-Rosenberg conjecture, J. Combinatorial Theory, Ser. B, 28 (1980), 85–95.

    Article  MathSciNet  MATH  Google Scholar 

  7. Knuth, D.E., The art of computer programming, Vol. 3, Sorting and Searching, Addison-Wesley, 1973.

    Google Scholar 

  8. Kahn, J., Saks, M., Sturtevant, D., A topological approach to evasiveness, Combinatorica, 4 (1984), 297–306.

    Article  MathSciNet  MATH  Google Scholar 

  9. Rivest, R.L., Vuillemin, J., On recognizing graph properties from adjacency matrices, Theor. Computer Science, 3 (1976/77), 371–384.

    Article  MathSciNet  MATH  Google Scholar 

  10. Triesch, M., Elusive properties, in Combinatorial Theory, Proceedings, Schloß Rauischholzhausen, 1982, (Jungnickel, D. and Vedder, K., eds), 321–326.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Mathematik, RWTH-Aachen, Templergraben 55, D-5100, Aachen, F.R.G.

    Eberhard Triesch

Authors
  1. Eberhard Triesch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Szymon Dolecki

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer Verlag

About this paper

Cite this paper

Triesch, E. (1989). On a search problem in graph theory. In: Dolecki, S. (eds) Optimization. Lecture Notes in Mathematics, vol 1405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083594

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51970-6

  • Online ISBN: 978-3-540-46867-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation