The prime graph odd-prime labeling conjecture
Statement
Let be a graph. A graph is prime if it admits a prime labeling, and odd prime if its vertices can be injectively labeled by so that adjacent vertices receive relatively prime labels. Prime graph odd-prime conjecture. Every prime graph is odd prime. No graph known to the authors is prime without being odd prime, while many graphs are known to be odd prime without being prime; the conjecture was previously introduced in the cited literature and remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.