Open Problem: Find a truly efficient algorithm to decide graph metrizability.
Statement
Open Problem: Find a truly efficient algorithm to decide graph metrizability. Specifics: • All outerplanar graphs are metrizable. • Every 2-connected metrizable graph on 11 or more vertices can be made outerplanar by removing at most one vertex. • We conjecture that a graph is not strictly metrizable iff it has a minor that is a member of a specific list of 6 small graphs (of 8 vertices or less). Open Problem: How large can ∆(P) be for a consistent n-point path system P? Figure 1. An example of a non-metric consistent path system.
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.