Class edge-reconstruction number of maximal planar graphs
Statement
Let be the class of finite maximal planar graphs. For , an edge card is a graph of the form , where . Define to be the least integer for which there exist edges such that the cards determine up to isomorphism among graphs in . Determine the universal class edge-reconstruction number . The cited preprint claims that this maximum is , that the octahedral graph has reconstruction number , and that some maximal planar graphs have reconstruction number .
Record
- Added
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.