Copyright © 1982 Published by Elsevier Science B.V. All rights reserved.
Sous-graphes traçables des graphes infinis
Received 20 September 1979;
Abstract
In this paper the traceable classes of an infinite graph are defined and studied. They are the classes of 1-traceable subgraphs (i.e. those subgraphs the edges of which can be arrange in an infinite sequence (en)nεN such that en≠ep if n≠p, and en,en+1 are adjacent) of the given graph which cannot be separated by the deletion of any finite set of edges. It is shown that these classes are closely related to some well-defined terminal classes (=ends) of the line-graph of the graph. Several properties of traceable classes are studied, in particular it is shown that the free classes can be distinguished as odd or even. These concepts are then used to give new solutions to two problems of Ore.






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)





