A $2$-regular graph has a prime labeling if and only if it has at most one odd component
Keyword(s):
Keyword(s):
2021 ◽
Vol 1836
(1)
◽
pp. 012009
Keyword(s):
2015 ◽
Vol 91
(3)
◽
pp. 353-367
◽