On a prime labeling conjecture.
From MaRDI portal
Recommendations
Cited in
(9)- A 2-regular graph has a prime labeling if and only if it has at most one odd component
- Prime labelings of infinite graphs
- Prime vertex labelings of families of unicyclic graphs
- scientific article; zbMATH DE number 867700 (Why is no real title available?)
- Prime labelings on planar grid graphs
- Minimum coprime graph labelings
- Proof of the prime ladder conjecture
- Prime labeling of some special class of graphs
- Prime labeling of grids
This page was built for publication: On a prime labeling conjecture.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428646)