A numerical equivalent of the four color map Problem

DOI10.1007/BF01707988zbMath0016.42002OpenAlexW1985022227MaRDI QIDQ5766652

No author found.

Publication date: 1937

Published in: Monatshefte für Mathematik und Physik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01707988

zbMATH Keywords

Topology

Related Items (1)

COLORING PLANAR GRAPHS VIA COLORED PATHS IN THE ASSOCIAHEDRA

Cites Work

• The coloring of graphs

This page was built for publication: A numerical equivalent of the four color map Problem