Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Chin-Mei Fu"'
Autor:
Chin-Mei Fu, Hung-Lin Fu
Publikováno v:
Le Matematiche, Vol 44, Iss 1, Pp 21-46 (1989)
In this paper, we mainly solve the intersection problem of three distinct latin squares of two different types: LS and ILS, and the intersections of ICLS and CLSH can be obtained by a similar way.
Externí odkaz:
https://doaj.org/article/45b6bfebbbd642b5ae4173b604383bc9
Publikováno v:
Graphs and Combinatorics. 32:1397-1413
Let $$K_{n,n}$$Kn,n be the complete bipartite graph with two parts of equal size n. In this paper, it is shown that depending on whether n is even or odd, $$K_{n,n}$$Kn,n or $$K_{n,n}-I$$Kn,n-I, where I is a 1-factor of $$K_{n,n}$$Kn,n, can be decomp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4b93e6d7e241b60e6b4620791b92e42
https://doi.org/10.1007/s00373-015-1664-9
https://doi.org/10.1007/s00373-015-1664-9
Publikováno v:
Discrete Mathematics. 313:2942-2950
A k -sun graph S ( C k ) is a graph obtained from a k -cycle by adding a pendent edge to each vertex of the k -cycle. A k -sun system of order v is a decomposition of the complete graph K v into k -sun graphs. In this paper, we find the necessary and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::737e83d63abced5fb6604a1fb10ce012
https://doi.org/10.1016/j.disc.2013.09.007
https://doi.org/10.1016/j.disc.2013.09.007
Publikováno v:
Discrete Mathematics. 313:726-732
A kite decomposition of a complete multipartite graph is said to be gregarious if each kite in the decomposition has its vertices in four different partite sets. In this paper, we give certain necessary and sufficient conditions for the existence of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9aa55d2fbdb69be070f40e84dde13f93
https://doi.org/10.1016/j.disc.2012.10.017
https://doi.org/10.1016/j.disc.2012.10.017
Publikováno v:
Discrete Mathematics. 313:498-507
A bull is a graph which is obtained by attaching two edges to two vertices of a triangle. A bull-design of order n is an ordered pair ( X , A ) , where X is the vertex set of K n and A is an edge-disjoint decomposition of K n into copies of bulls. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a577be001817491c8078beed34a09639
https://doi.org/10.1016/j.disc.2012.11.023
https://doi.org/10.1016/j.disc.2012.11.023
Publikováno v:
International Mathematical Forum. 8:273-281
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0ff472d7e550c96b5e2b1594505910a
https://doi.org/10.12988/imf.2013.13026
https://doi.org/10.12988/imf.2013.13026
Autor:
Chao-Chih Chou, Chin-Mei Fu
Publikováno v:
Journal of Combinatorial Optimization. 14:205-218
In this paper we show the sufficient conditions for the decomposition of the complete bipartite graphs K2m,2n and K2n+1,2n+1−F into cycles of two different lengths 4 and 2t, t>2, where F is a 1-factor of K2n+1,2n+1. After that we prove that the res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::884ca69968279c383edd0dd3537e3abb
https://doi.org/10.1007/s10878-007-9060-x
https://doi.org/10.1007/s10878-007-9060-x
Publikováno v:
Journal of Combinatorial Optimization. 14:323-329
Let $K_{n_{1},n_{2},\ldots,n_{m}}$ be a complete m-partite graph with partite sets of sizes n 1,n 2,…,n m . A complete m-partite graph is balanced if each partite set has n vertices. We denote this complete m-partite graph by K m(n). In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::764a4a50067df10e1520120d1b12ac1d
https://doi.org/10.1007/s10878-007-9049-5
https://doi.org/10.1007/s10878-007-9049-5
Publikováno v:
Discrete Mathematics. 282(1-3):123-136
This paper consists of a study of the intersection problems for totally symmetric latin squares.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1949d1f28390b60a4410ab8c79a240f9
Publikováno v:
Discrete Mathematics. :195-203
Let Km,n be the complete bipartite graph and Cr be an elementary cycle of length r. In this paper, it is shown that G can be decomposed into p copies of C4, q copies of C6 and r copies of C8 for each triple p,q,r of nonnegative integers such that 4p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f553ecfd9575d733b079fc1f7f65fc18
https://doi.org/10.1016/s0012-365x(99)90063-8
https://doi.org/10.1016/s0012-365x(99)90063-8