论文信息 - Orthogonal factorizations of graphs

Orthogonal factorizations of graphs

Let G be a graph with vertex set V(G) and edge set E(G). Let k1, k2,…,km be positive integers. It is proved in this study that every [0,k1+…+km-m+1]-graph G has a [0, ki]1m-factorization orthogonal to any given subgraph H with m edges. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 267–276, 2002

Haodi Feng | Guizhen Liu

[1] W. T. Tutte. The 1-factors of oriented graphs , 1953 .

[2] Lou Caccetta,et al. Orthogonal matchings , 1998, Discret. Math..

[3] Dominique Sotteau,et al. On the existence of a matching orthogonal to a 2-factorization , 1989, Discret. Math..

[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[5] László Lovász,et al. Subgraphs with prescribed valencies , 1970 .

[6] T. Gallai. Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen , 1964 .

[7] Binhai Zhu,et al. Some Problems on Factorizations with Constraints in Bipartite Graphs , 2003, Discret. Appl. Math..

[8] Peter Che Bor Lam,et al. Orthogonal (g, f)‐factorizations in networks , 2000 .

[9] Jin Akiyama,et al. Factors and factorizations of graphs - a survey , 1985, J. Graph Theory.

[10] Guizhen Liu,et al. (g, f)-factorizations orthogonal to a subgraph in graphs , 1998 .

[11] Mikio Kano. [a, B]-factorization of a Graph , 1985, J. Graph Theory.

[12] Guizhen Liu. Orthogonal (g, f)-factorizations in graphs , 1995, Discret. Math..

[13] Liu Guizhen,et al. Orthogonal (g, f)-factorizations of bipartite graphs , 2001 .