On graphs with a unique perfect matching - 论文文献免费下载 - 皮皮文库

On graphs with a unique perfect matching

来源 :第五届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户：taiguomin

【摘要】

：

　　In this talk I report some results on the graphs with a unique perfect matching.One of them is a strengthening of Kotzigs theorem, which says that if a conn

【出处】

：

第五届全国组合数学与图论大会

【发表日期】

：

2012年7期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　In this talk I report some results on the graphs with a unique perfect matching.One of them is a strengthening of Kotzigs theorem, which says that if a connected graph has a unique perfect matching, then it has a cut edge belonging to this perfect matching.

其他文献

Segregation phenomena in flowing suspensions of deformable particles toward an understanding of cell

会议

Unsteady boundary layers on flapping wings

会议

Pairwise interactions between squirming micro-organisms

会议

Analysis of free vibrations of carbon nanocones using continuum mechanics and molecular dynamic simu

会议

Twin-spacing dependent yield strength in the materials with hierarchical nanostructures

会议

Mechanism of wrinkle formation in chemical vapor deposited graphene and tuning its morphology by sub

会议

Visualization experimental and numerical investigation on the muzzle flow

会议

On the evolution of a heavy-gas cylinder accelerated by a cylindrical converging shock wave effect o

会议

Tutte Polynomial and G-Parking Functions

　　For every undirected graph, Tutte [3] defined a polynomial TG(x;y) in two variables which plays an important role in graph theory.Now this polynomial is cal

会议

Constructions of Optimal Perfect Codes in Deletion and Insertion Metric

　　There are two kinds of perfect t-deletion-correcting codes of length k over an alphabet of size v, those where the coordinates may be equal and those where

会议

其他学术论文