I had a stupid idea recently, what if we restrict graphs in terms of order of edges(clockwise) that go outwards from the node. Like on picrel, we fixate the fact that edges connected to node 1 are e1, e2, e3 clockwise. Will this modification provide more applicability to graph theory in terms of real life geometry-related problems.(e.g. transportation system optimizations). In case im stupid and these types of graphs already were studied please let me know.