Skip to main content
Log in

All Solutions to the Immobilizer Problem

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. S Chaiken and D.J Kleitman. Matrix tree theorems. Journal of Combinatorial Theory, Series A, 24(3):377–381, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  2. Takeaki Uno. An algorithm for enumerating all directed spanning trees in a directed graph. In Algorithms and Computation, volume 1178 of Lecture Notes in Computer Science, pages 166–173. Springer, Berlin Heidelberg, 1996.

  3. Peter Winkler. Mathematical Puzzles: A Connoisseur's Collection, A. K. Peters, Ltd., Natick, MA, 2004.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ben Heuer.

Additional information

Note: The Mathematical Intelligencer accepts no responsibility should any reader (or editor) of this article be immobilized – Marjorie Senechal.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Conway, J., Heuer, B. All Solutions to the Immobilizer Problem. Math Intelligencer 36, 78–86 (2014). https://doi.org/10.1007/s00283-014-9503-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00283-014-9503-z

Keywords

Navigation