超欧拉图的一个注记  

A Note on Supereulerian Graphs

作　　者：王斌[1] 

机构地区：[1]重庆工商大学理学院,重庆400020

出　　处：《西南师范大学学报（自然科学版）》2003年第1期30-32,共3页Journal of Southwest China Normal University(Natural Science Edition)

摘　　要：得到了超欧拉图的一个特征性质:G是简单图,则G是超欧拉图当且仅当G中有边不交路P1,…,Ps,使得E(Pi)连通.利用它可以证明:当m,n不其端点两两不同,并且满足O(G)={Pi的端点|=1,2,…,s},G-∪si=1同时为3时,m×n型矩形网格图是超欧拉图.A characteristic property of supereulerian graphs is present that a simple graph G is supereulerian if and only if there are edgedisjoint paths in G whose endpoints are different in pair and make up the odddegree vetex set of G such that the complement of the union of these paths are connected.With the property m×n rectanglegrid graph can be proved supereulerian with m≠3,n≠3.

关 键 词：超欧拉图 简单图 矩形网格图 边不交路 欧拉生成子图 可折叠图 

分 类 号：O157.5[理学—数学]