ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (2402 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0012-365X(82)90292-8    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1982 Published by Elsevier Science B.V. All rights reserved.

Sous-graphes traçables des graphes infinis

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Norbert Polat

Départment de mathématiques, Université de Montréal, C.P. 6128, Succ. “A”, Montréal, Québec, H373J7, Canada


Received 20 September 1979; 
revised 3 March 1981. 
Available online 29 August 2002.

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 enep if np, 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.

Article Outline

• References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.