Circular Coloring Signed Graphs Has No Contains Kk minor

In 1943, Hugo Hadwiger showed that any graph that contains no K4 minors is 3colorable. He considers any graph which has no Kk 1 minors is k colorable. Based on Naserasr, Wang and Zhu's definitions 2456-6470, Volume-7 | Issue-1 , February 2023, URL: https://www.ijtsrd.com/papers/ijtsrd52625.pdf Paper URL: https://www.ijtsrd.com/mathemetics/other/52625/circular-coloring-signed-graphs-has-no-contains-kkminor/pie-desire-ebode-atangana