{"title":"A $2$-regular graph has a prime labeling if and only if it has at most one odd component","authors":"J. Schroeder","doi":"10.4310/joc.2021.v12.n3.a1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":44683,"journal":{"name":"Journal of Combinatorics","volume":"160 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4310/joc.2021.v12.n3.a1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}