A 2-regular graph has a prime labeling if and only if it has at most one odd component

DOI10.4310/JOC.2021.v12.n3.a1zbMath1468.05269OpenAlexW3186641656MaRDI QIDQ2041701

Justin Z. Schroeder

Publication date: 23 July 2021

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2021.v12.n3.a1

zbMATH Keywords

regular graphgraph labelingprime labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: A 2-regular graph has a prime labeling if and only if it has at most one odd component