Title

A decomposition of locally finite graphs

Document Type

Article

Publication Date

7-1-1993

Abstract

We prove that every infinite, connected, locally finite graph G can be expressed as an edge-disjoint union of a leafless tree T, rooted at an arbitrarily chosen vertex of G, and a collection of finite graphs H1, H2, H3,...such that, for all i less than j, the vertices common to Hi and Hj lie in T, and no vertex of Hj lies on T between a vertex of Hi∩T and the root. © 1993.

Publication Source (Journal or Book title)

Discrete Mathematics

First Page

161

Last Page

168

This document is currently not available here.

Share

COinS