Skip to main content
SpringerLink
Log in

A numerical equivalent of the four color map Problem

  • Published:
Monatshefte für Mathematik und Physik Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literatur

  1. A theorem on graphs, Annals of Math., vol.32 (1931), pp. 378–390. We refer to this paper as G. In connection with the map problem, see a coming number of the Mémorial des Sciences Mathématiques, by G. D. Birkhoff.

  2. See G., p. 390; J. H. M. Wedderburn, Annals of Math., vol.24 (1923), p. 121).

    Article  Google Scholar 

  3. See for instance Whitney, the coloring of graphs. Annals of Math., vol.33 (1932), p. 691.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cambridge, USA

    Hassler Whitney

Authors
  1. Hassler Whitney
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Mit 2 Textfiguren.

Presented to the American Mathematical Society, Dec. 26, 1933.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Whitney, H. A numerical equivalent of the four color map Problem. Monatsh. f. Mathematik und Physik 45, 207–213 (1936). https://doi.org/10.1007/BF01707988

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation