2 problems

A graph is strictly metrizable if every pair of vertices has a unique shortest path under some positive edge weighting. The forbidden-minor conjecture. A graph is strictly metrizab…

Let $n$ be an integer, and let a circulant graph mean a graph whose vertices are arranged cyclically with adjacency determined by a fixed set of cyclic differences. The monophonic…