Document Type
Article
Publication Date
7-2008
Abstract
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 kconnected subgraphs for k > 2.
Recommended Citation
Zimmermann, Martin. (2008) Independent Study on Infinite Graph Theory.
https://via.library.depaul.edu/tr/4
TR08-004[1].pdf (99 kB)
TR08-004[1].pdf
TR08-004[1].pdf
Comments
TR08-004