Quasirecognition by prime graph of 2 D n (3α) where n = 4m + 1 ≥ 21 and α is odd
Crossref DOI link: https://doi.org/10.1134/S0001434614030018
Published Online: 2014-04-30
Published Print: 2014-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Babai, A.
Khosravi, B.
Text and Data Mining valid from 2014-03-01
Version of Record valid from 2014-03-01
Article History
Received: 28 July 2012
First Online: 30 April 2014