The fully cycle extendable conjecture for locally connected regular graphs with bounded second neighborhoods
Statement
Let be a graph in , where denotes the class of connected -regular graphs whose vertices have at most vertices at distance two, and suppose that is locally connected, meaning that the neighborhood of every vertex induces a connected graph. Fully cycle extendable conjecture. If , then is fully cycle extendable: every vertex of belongs to a triangle, and for every non-Hamiltonian cycle in there is a cycle such that and . This would extend known Hamiltonicity results for locally connected graphs in this class; the supplied text gives no resolution of the conjecture.
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.