论文信息 - A parameter linked with G-factors and the binding number - 字舞流文

A parameter linked with G-factors and the binding number

Abstract In this note we study a new parameter of graph and link it with already known notions such as quasi-regularizable graphs, the binding number and star-factors.

Odile Favaron | Dominique Sotteau | M. C. Heydemann | J. C. Meyer

[1] C. Berge. Graphes et hypergraphes , 1970 .

[2] Fan Chung Graham,et al. The forwarding index of communication networks , 1987, IEEE Trans. Inf. Theory.

[3] Marie-Claude Heydemann,et al. On forwarding indices of networks , 1989, Discret. Appl. Math..

[4] William H. Cunningham. Computing the binding number of a graph , 1990, Discret. Appl. Math..

[5] Pavol Hell,et al. Packings by complete bipartite graphs , 1986 .

[6] D. R. Woodall. The binding number of a graph and its Anderson number , 1973 .

[7] David G. Kirkpatrick,et al. On Generalized Matching Problems , 1981, Inf. Process. Lett..

[8] Ernst G. Straus,et al. Which rational numbers are binding numbers? , 1981, J. Graph Theory.

[9] C. Berge. Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs , 1982 .