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    
Journal of Combinatorial Theory, Series B
Volume 74, Issue 2, November 1998, Pages 192-201
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (495 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1006/jctb.1998.1842    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1998 Academic Press. All rights reserved.

Regular Article

Contractible Non-edges in 3-Connected Graphs

Matthias Kriesell*

Fachbereich Mathematik, Technische Universität Berlin, Straße des 17. Juni 136, D-10623, Berlin, Germany

Received 29 September 1997. 
Available online 8 April 2002.

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.

Abstract

We present a reduction theorem for the class of all finite 3-connected graphs which does not make use of the traditional contraction of certain connected subgraphs.


 
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.