2017/06/11 by Meiqiao Zhang, Zhang, Meiqiao, Xian’an Jin +3
Computer Science · Engineering · Mathematics · #57M27 #Advanced Graph Theory Research #Algebraic Topology (math.AT) #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1706.08837
openalex publication_date 2017/06/11 · openalex created_date 2017/07/14 · openalex updated_date 2026/07/28
K. Ichihara and E. Matsudo introduced the notions of ℤ-colorable links and the minimal coloring number for ℤ-colorable links, which is one of invariants for links. They proved that the lower bound of minimal coloring number of a non-splittable ℤ-colorable link is 4. In this paper, we show the minimal coloring number of any non-splittable ℤ-colorable link is exactly 4.