首页   按字顺浏览 期刊浏览 卷期浏览 The 3‐connected graphs with a maximum matching containing precisely one contractible ed...
The 3‐connected graphs with a maximum matching containing precisely one contractible edge

 

作者: R. E. L. Aldred,   Robert L. Hemminger,   Xingxing Yu,  

 

期刊: Journal of Graph Theory  （WILEY Available online 1994）
卷期: Volume 18, issue 1  

页码: 37-50

 

ISSN:0364-9024

 

年代: 1994

 

DOI:10.1002/jgt.3190180105

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractIt has previously been shown that ifMis a maximum matching in a 3‐connected graphG, other thanK4, thenMcontains at least one contractible edge ofG. In this paper, we give a constructive characterization of the 3‐connected graphsGhaving a maximum matching containing only one contractible edge

 

点击下载:  PDF (676KB)



返 回