Abreu–Diwan–Jackson–Labbate–Schwenk's classification conjecture for 3-edge-connected pseudo 2-factor isomorphic graphs
Statement
A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. A star product is the cubic graph operation that deletes one degree-3 vertex from each factor and joins the three resulting pairs of neighbours. Let be a 3-edge-connected cubic bipartite graph.
Abreu–Diwan–Jackson–Labbate–Schwenk's conjecture. is pseudo 2-factor isomorphic if and only if can be obtained from , the Heawood graph or the Pappus graph by repeated star products.
This conjecture gives a proposed classification of all 3-edge-connected cubic bipartite graphs with the parity property. The supplied text gives no resolution of this statement.
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.