论文信息 - 1-factorizing Regular Graphs of High Degree - an Improved Bound

1-factorizing Regular Graphs of High Degree - an Improved Bound

We showed eariler that a regular simple graph of even order satisfying d(G) » 6/7|V(G)| was the union of edge-disjoint 1-factors. Here we improve this to regular simple graphs of even order satisfying d(G)≥ 1/2(√7- 1)|V(G)|.

Anthony J. W. Hilton | Amanda G. Chetwynd

[1] A. Hilton,et al. Regular Graphs of High Degree are 1‐Factorizable , 1985 .

[2] Dean G. Hoffman,et al. On the Delta-subgraph of graphs which are critical with respect to the chromatic index , 1989, J. Comb. Theory, Ser. B.

[3] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[4] Anthony J. W. Hilton,et al. A Delta-subgraph condition for a graph to be class 1 , 1989, J. Comb. Theory, Ser. B.

[5] Dean G. Hoffman,et al. Class one graphs , 1987, J. Comb. Theory, Ser. B.