A numerical equivalent of the four color map Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A numerical equivalent of the four color map Problem

Published:1936-12 Issue:1 Volume:45 Page:207-213
ISSN:0026-9255
Container-title:Monatshefte für Mathematik und Physik
language:en
Short-container-title:Monatsh. f. Mathematik und Physik

Author:

Whitney Hassler

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF01707988.pdf

Reference3 articles.

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).

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

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. COLORING PLANAR GRAPHS VIA COLORED PATHS IN THE ASSOCIAHEDRA;International Journal of Algebra and Computation;2013-09

2. The book thickness of a graph;Journal of Combinatorial Theory, Series B;1979-12

3. Chromatic polynomials;Transactions of the American Mathematical Society;1946

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP