无爪图的极大欧拉生成子图边数问题  

The edge-number of maximum spanning eulerian subgraphs of claw-free graphs

作　　者：雷澜[1] 

机构地区：[1]重庆工商大学数学与统计学院,重庆400067

出　　处：《重庆工商大学学报（自然科学版）》2008年第3期233-235,共3页Journal of Chongqing Technology and Business University:Natural Science Edition

基　　金：重庆市自然科学基金CSTC(2002BA2024);重庆市教委项目资助(KJ0707010)

摘　　要：研究了无爪图的极大欧拉生成子图边数问题,给出了当其最小度不小于4,且去掉极大欧拉生成子图后图的分支数不小于顶点数的1/4时,catlin-猜想成立;进一步得到了最大度不小于5时,超欧拉无爪图的极大欧拉生成子图一定不是Ham iltion圈的结论.In this note, the author does some research into the edge - number of maximum spanning eulerian subgrahs of claw - free graphs, and gets that when its minimum degree at least 4 and component numbers at least the quarter of vertex numbers, the graph satisfies the Catlin - conjecture. And then, the result is got that if H is the maximum spanning eulerian graph of a supereulerian claw - free graph with △（G） ≥5, then H isn＇t Hamiltion circle.

关 键 词：极大欧拉生成子图 无爪图 边数 

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