Engineering Commons^™

Independent Study On Infinite Graph Theory, Martin Zimmermann

Technical Reports

In this paper we will prove some results about infinite graphs. We show that for every linear order there is a graph with a distinguished vertex such that the edges adjacent to that vertex have the given order in any plane drawing. The other results are concerned with connectivity. We prove a generalization of a characterization of 2-­connected graphs and prove that k-­connectedness does not imply the existence of finite k­connected subgraphs for k > 2.