Wolfgang HakenRecognizing Knots and Colouring Maps

被引：0
|
作者：
Siddhartha Gadgil [1 ]
机构：
[1] Indian Institute of Science,Department of Mathematics
来源：
Resonance | 2025年 / 30卷 / 1期
关键词：
Topology; knot; surface; unknot; four colour theorem; Appel-Haken proof; graph theory; graph colourings; planar graph;
D O I：
10.1007/s12045-025-1728-y
中图分类号：
学科分类号：
摘要：
Wolfgang Haken (1928–2022) was a German American mathematician who made pathbreaking contributions to topology and graph theory, most notably the discovery of an algorithm to recognize the unknot and (with Kenneth Appel) the solution to the four-colour problem.
引用
收藏
页码：15 / 43
页数：28
相关论文
共 11 条
  • [1] THE COLOURING OF MAPS
    DIRAC, GA
    NATURE, 1952, 169 (4303) : 664 - 664
  • [2] THE COLOURING OF RELIEF MAPS
    不详
    GEOGRAPHICAL JOURNAL, 1911, 38 (04): : 428 - 430
  • [3] Coincidence and the colouring of maps
    Aarts, JM
    Fokkink, RJ
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1998, 30 : 73 - 79
  • [4] Maps from knots in the cylinder to flat-virtual knots
    Manturov, Vassily O.
    Nikonov, Igor M.
    RUSSIAN MATHEMATICAL SURVEYS, 2024, 79 (02) : 366 - 368
  • [5] Long knots and maps between operads
    Dwyer, William
    Hess, Kathryn
    GEOMETRY & TOPOLOGY, 2012, 16 (02) : 919 - 955
  • [6] UNIVERSAL FORM OF RENORMALIZABLE KNOTS IN SYMBOLIC DYNAMICS OF BIMODAL MAPS
    Gao, Wen
    Xu, Chuan-Yun
    Peng, Shou-Li
    Cao, Ke-Fei
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2013, 23 (09):
  • [7] PSEUDO-ANOSOV MAPS AND SURGERY ON FIBERED 2-BRIDGE KNOTS
    GABAI, D
    KAZEZ, WH
    TOPOLOGY AND ITS APPLICATIONS, 1990, 37 (01) : 93 - 100
  • [8] Monodromy Maps of Fibered 2-Bridge Knots as Elements in Automorphism Groups of Free Groups
    Goda, Hiroshi
    Suzuki, Masaaki
    KYUNGPOOK MATHEMATICAL JOURNAL, 2016, 56 (03): : 927 - 938
  • [9] Increasing Accessibility for Map Readers with Acquired and Inherited Colour Vision Deficiencies: A Re-Colouring Algorithm for Maps
    Culp, Gretchen Maria
    CARTOGRAPHIC JOURNAL, 2012, 49 (04): : 302 - 311
  • [10] Edge-colouring pairs of binary trees: Towards a concise proof of the four-colour theorem of planar maps
    Gibbons, A
    Sant, P
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 25 - 39
12