Abstract
Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\em routes} rather than {\em edges} as primitives. This article is intended to introduce the relevant (discrete setting) notion of {\em routed network} to graph theorists. We give a naive classification of all 71 topologically different such networks on 4 leaves, and pose a variety of challenging research questions.
Keywords
planar graph, topological graph theory, graph limits
Full Text:
PDF
DOI:
http://dx.doi.org/10.5614/ejgta.2016.4.1.5
Refbacks
There are currently no refbacks.
ISSN: 2338-2287
This work is licensed under a
Creative Commons Attribution-ShareAlike 4.0 International License .
<div class="statcounter"><a title="web analytics" href="http://statcounter.com/" target="_blank"><img class="statcounter" src="//c.statcounter.com/11284516/0/7b1b10eb/1/" alt="web analytics"></a></div> View EJGTA Stats