The minimum-leaf conjecture for 3-connected cubic graphs
Statement
Let be a 3-connected cubic graph of order , and let denote its minimum leaf number. Minimum-leaf conjecture for 3-connected cubic graphs.
The conjecture is presented as open; constructions in the paper are intended to show that the bound is sharp.
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.