摘要
A2-FACTORIZATIONORTHOGONALTOASTARINAGRAPH¥LIUGuishen(DepartmentofMathematics,ShandongUniversity,Jinan250100,China)Abstract:Le...
Let G be a graph and let F={F1,…,Fd}and H be a factorisation and a subgraph of G, respectively. If H exactly has one edge in common with Fi for all i,1 ≤ i ≤ d, then we Say that F is orthogonal to H. In this paper it is proved that if H is a &star of a 2d-reghar graph G such that a set of any two edges of H is not a outset of any 4regular subgraph of G, then there is a 2-factorization of -G orthogonal to H. E8pecially,if G is a 2d-regular graph such that any connected 4regular subgraph is 4-edge connected,then for any 4star H, G has a 2-factorisation orthogonal to H.