13 problems
Generalized Petersen graph conjecture. Every generalized Petersen graph is an induced subgraph of a minimal Cayley graph.
Let and be integers with , and let be the generalized Petersen graph with star chromatic index , the smallest number of colors i…
Jerebic's conjecture. For any , there exists a positive integer such that is not distance-balanced for every . The conjecture was positively resol…
Let be an integer, and define … For a graph , write for its diameter. Miklavič–Šparl conjecture. For every , the generalized Petersen graph is not…
Let be a generalized Petersen graph. A semigroup graph is a graph admitting a Cayley representation by a semigroup. The semigroup representation conjecture. Every generali…
Let be a non-bipartite generalized Petersen graph, and let be an endomorphism of . The retract-image conjecture. The image of is a retract of . The…
Let be a generalized Petersen graph, and let denote a monoid Cayley graph with connection set of size . The monoid Cayley characterization conjectu…
Let be the generalized Petersen graph and let be the circulant graph with step sizes and . Let and…
Let , and let be the generalized Petersen graph. Let denote its minimum coprime number. The minimum-coprime-number conjecture. … T…
Let be the generalized Petersen graph, with odd, and let denote its minimum coprime number. The minimum-coprime-number conjecture. For…
The eventual non--distance-balance conjecture. For any , the graph is not -distance-balanced for any integer with . Moreover, …
Let be the generalized Petersen graph, and let denote the size of a minimum vertex cover. Behsaz–Hatami–Mahmoodian's conjecture. For all and , … Sin…
Let be the generalized Petersen graph, and let denote its independence polynomial. For all integers…