Every planar map is four colorable-Reference-Cited by-同舟云学术

Every planar map is four colorable

Published:1976 Issue:5 Volume:82 Page:711-712
ISSN:0273-0979
Container-title:Bulletin of the American Mathematical Society
language:en
Short-container-title:Bull. Amer. Math. Soc.

Author:

Appel K.,Haken W.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/bull/1976-82-05/S0002-9904-1976-14122-5/S0002-9904-1976-14122-5.pdf

Reference4 articles.

1. 1.. F. Allaire and E. R. Swart, A systematic approach to the determination of reducible configurations, J. Combinatorial Theory Ser. B (to appear).

2. The existence of unavoidable sets of geographically good configurations;Appel, K.;Illinois J. Math.,1976

3. B. I. Hochschulskripten;Heesch, Heinrich,1969

4. Kempe chains and the four colour problem;Whitney, Hassler;Utilitas Math.,1972

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

1. Theorem proving in artificial neural networks: new frontiers in mathematical AI;European Journal for Philosophy of Science;2024-01-20

2. Reduction in Degrees of Freedom for Large-Scale Nonlinear Systems in Computer-Assisted Proofs;Mathematics;2023-10-18

3. Next-Generation Automatic Human-Readable Proofs Enabling Polynomial Formal Verification;Proceedings of the 21st ACM-IEEE International Conference on Formal Methods and Models for System Design;2023-09-21

4. ISOMORPH: an efficient application on GPU for detecting graph isomorphism;Engineering Computations;2023-09-06

5. On zonal and inner zonal labelings of plane graphs of maximum degree 3;Discrete Mathematics Letters;2023-08-25