【摘要】 结合可折叠子图给出了可折叠α-子图的概念,得到可折叠α-子图一定为α-子图,并得到可折叠α-子图的顶点有交且边不交的并仍为可折叠α-子图.同时得到至多差1边具有3棵边不交的生成树的图和K_l,m（l≥3,m≥3）均是可折叠2/3-子图,并给出其在寻找欧拉生成子图极大边数的应用,同时也得到了一种寻找α-子图的方法.更多还原

【Abstract】 Combining the collapsible graph,the collapsible a-subgraph is presented which also is a-subgraph,and the union of two edge disjoint a-subgraphs which have common vertices is a-subgraph too,which implies a method to find a-subgraph.As an application,that the graphs which have at most one edge short of three edge disjoint spanning trees and K_l,m（l≥3,m≥3） both are collapsible 2/3-subgraph is obtained.At the same time,how to find the edge-number of spanning eulerian subgraph by collapsible a-subgraph is shown also.更多还原