The 2-ranking conjecture for subcubic graphs
Statement
Let be a subcubic graph, meaning that every vertex of has degree at most , and let denote its 2-ranking number. The 2-ranking conjecture for subcubic graphs. If is subcubic, then
and equality holds if and only if is the cubic graph obtained from by joining vertices at distance . The surrounding discussion notes that the Petersen and Heawood graphs, despite being plausible candidates, admit 2-rankings with only 5 ranks; the stated classification identifies the remaining extremal graph.
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.