| 參考文獻 |
J. Akiyama, G. Exoo and F. Harary,
Covering and packing in graphs III: Cyclic and acyclic invariants,
Math. Slovaca 30 (1980), 405--417.
J. Akiyama, G. Exoo and F. Harary,
Covering and packing in graphs IV: Linear arboricity,
Networks 11 (1981), 69--72.
J. Akiyama and T. Hamada,
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests,
Discrete Math. 26 (1979), 203--208.
J. Akiyama and M. Kano,
Path factors of a graph, in: Graphs and Applications,
Proceedings of the 1st Colorado Symposium on Graph Theory, 1982, 1--21.
I. Algor and N. Alon,
The star arboricity of graphs,
Discrete Math. 75 (1989), 11--22.
Y. Aoki,
The star-arboricity of the complete regular multipartite graphs,
Discrete Math. 81 (1990), 115--122.
L. W. Beineke,
Graph decompositions,
Congr. Num. 115 (1996), 213--226.
J. C. Bermond and D. Sotteau,
Graph decompositions and G-designs,
Fifth British Combinatorial Conf., Aberdeen
Congr. Num. XV (1975), 53--72.
J. C. Bermond K. Heinrich and M.-L. Yu,
Existence of resolvable path designs
Europ. J. Combinatorics 11 (1990), 205--211.
J. A. Bondy and U. S. R. Murty,
Graph Theory with Applications.
North Holland, New York (1976), 101.
J. Bos 'ak,
Decompositions of Graphs.
Kluwer Academic Publishers, Dordrecht. The Netherlands, 1990.
D. De Caen and D. G. Hoffman,
Impossibility of decomposing the complete graph on n points into n-1
isomorphic complete bipartite graphs,
SIAM J. Discrete. Math. 2 (1989), 48--50.
P.V. Caetano and K. Heinrich,
A note on distar factorizations,
Ars Combin. 30 (1990), 27--32.
N.J. Cavenagh,
Decompositions of complete tripartite graphs into $k$-cycles,
Australasian J. Combin. 18 (1998), 193--200.
G. Chartrand and L. Lesniak,
Graphs and Digraphs (2nd ed.),
Wadsworth, (1986), 85.
F. R. K. Chung and R. L. Graham,
Recent advances in graph decompositions in combinatorics,
Proceeding of 8th British Combinatorial Conference (University College, Swansea, 1981), edited by H.N.V. Temperley,
London Math. Soc. Lecuture Notes 1120, Combridge University Press (1981), 103--124.
C. J. Colbourn, D. G. Hoffman, C. A. Rodger,
Directed star decompositions of the complete directed graph,
J. Graph Theory 16 (1992), 517--528.
C. J. Colbourn, D. G. Hoffman, C. A. Rodger,
Directed star decompositions of directed multigraphs,
Discrete Math. 97 (1991), 139--148.
A. Donald,
An upper bound for the path number of a graph,
J. Graph Theory 4 (1980), 189--201.
B. Du,
$K_{1,p^2}$-factorization of complete bipartite graphs,
Discrete Math. 187 (1998), 273--279.
Y. Egawa, M. Urabe, T. Fukuda and S. Nagoya,
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components,
Discrete Math. 58 (1986), 93--95.
S. El-Zanati and C. Vanden,
Cycle factorizations of cycle products,
Discrete Math. 189 (1998), 267--275.
H. Enomoto and Y. Usami,
The star arboricity of cComplete bipartite graphs,
Graph Theory, Combinatorics, and Applications 1 (1988), 389--396.
H. Enomoto, T. Miyamoto and K. Ushio,
$C_k$-factorization of complete bipartite graphs,
J. Graphs Combin. 4 (1988), 111--113.
bibitem{hana}
H. Hanani,
Balanced incomplete block designs,
{ it Discrete Math.}
{ bf 4} (1975), 255--369.
bibitem{hary}
F. Harary and A.J. Schwenk,
Evolution of the path number of a graph:
Covering and Packing in Graphs, uppercase expandafter{ romannumeral 2},
{ it Graph Theory and Computing},
edited by R.C. Read,
Acad. Press, NY, (1972), 39--45.
J. D. Horton,
Resolvable path designs,
J. Combin. Theory, Ser. A 39 (1985), 117--131.
C. Huang and A. Rosa,
On the existence of balanced bipartite designs,
Utilitas Math. 4 (1973), 55--75.
C. Huang,
On the existence of balanced bipartite designs II,
Discrete Math. 9 (1974), 147--159.
C. Huang,
Resolvable balanced bipartite designs,
Discrete Math. 14 (1976), 319--335.
S. H. Y. Hung and N. S. Mendelsohn,
Handcuffied designs,
Deiscrete Math. 18 (1977), 23--33.
B. W. Jackson,
Some cycle decompositions of complete graphs,
Journal of Combinatorics, Information & System Sciences 13 (1988), 20--32.
L. O. James, R. G. Stanton and D. D. Cowan,
Some results on tree numbers,
Proceedings of the Second Louisiana Conference on Combinatorics,
Graph Theory and Computing, Baton Rouge, (1971), 317--330.
A. Kurek,
Arboricity and star arboricity of graphs,
Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice,1990),
Annal Discrete Math. 51 (1992), 171-173.
C. Lin and J.-J. Lin,
Cycle decompositions of crowns,
Discrete Math., to appear.
C. Lin, J.-J Lin, and H.-C. Lee,
Some decomposition invariants of crowns,
Submitted.
C. Lin, J.-J. Lin and T.-W. Shyu,
Complete bipartite decomposition of crowns,
with applications to complete directed graphs,
Lecuture Notes in Computer Science 1120 (1996), 58--66.
C. Lin, J.-J. Lin and T.-W. Shyu,
Isomorphic star decomposition of multicrowns and the power of cycles,
ARS Combinatoria, 53 (1999), 249-256.
C. Lin and T.-W. Shyu,
A necessary and sufficient condition for the star decomposition of complete graphs,
J. Graph Theory 23 (1996), 361--364.
J.-J. Lin,
Multiple Star Decompositions of Complete Multigraphs and Some Decompositions of Crowns,
Ph.D. Thesis, Department of Mathematics, National Central University, Taiwan (1999).
C. C. Lindner and C. A. Rodger,
Decomposition into cycles II: Cycle systems, in
Contemporary Design Theory, edited by J.H. Dinitz, D.R. Stinson.
John Wiley and Sons, Inc. (1992), 325--369.
L.Lov 'asz,
On covering of graphs, in it Theory of Graphs
(Proceedings of the Colloquium held at Tihany, Hungary, September, 1966),
edited by P. Erd "os and G. Katona, Academic, New York (1968), 231--236.
N. Martin,
Complete bipartite factorizations by complete bipartite graphs,
Discrete Math. 167/168 (1997), 461--480.
N. Martin,
Balanced bipartite graphs may be completely star-factored,
J. Combin. Des. 5 (1997), 407--415.
A. Muthusamy and P. Paulraja,
Path factorizations of complete multipartite graphs,
Discrete Math. 195 (1999), 181--201.
C. St. J. A. Nash-Williams,
Decomposition of finite graphs into forests,
J. London Math. Soc. 39 (1964), 12.
D. Pritikin,
Applying a proof of Tverberg to complete
bipartite decompositions of dgraphs and multigraphs,
J. Graph Theory 10 (1986), 197--201.
H.J. Ryser,
Combinatorial properties of matrices of zeros and ones,
Canad. J. Math. 9 (1957), 371--377.
H. J. Ryser,
Combinatorial Mathematics.
Carus Math. Monograph 14 (1963), 63.
I. Satake,
Linear Algebra.
Marcel Dekker, Inc, New York (1975), 91.
T.-W. Shyu,
The Decomposition of Complete Graphs, Complete Bipartite Graphs and Crowns,
Ph.D. Thesis, Department of Mathematics, National Central University, Taiwan (1997).
D. Sotteau,
Decomposition of $K_{m,n}(K_{m,n}^* )$ into cycles (circuits) of length 2k,
J. Combin. Theory, Ser. B 30 (1981), 75--81.
R.G. Stanton, D.D. Cowan and L.O. James,
Some results on path numbers,
Proceedings of the first Louisiana Conference on Combinatorics,
Graph Theory and Computing}, Baton Rouge, (1970), 112--135.
R. G. Stanton, D. D. Cowan and L. O. James,
Some results on tree numbers,
Proceedings of the Second Louisiana Conference on Combinatorics,
Graph Theory and Computing, Baton Rouge, (1971), 317--330.
M. Tarsi,
Decomposition of complete multigraphs into stars,
Discrete Math. 26 (1979), 273--278.
M. Tarsi,
On the decomposition of a graph into stars,
Discrete Math. 36 (1981), 299--304.
M. Tarsi,
Decomposition of complete multigraph into simple paths: nonbalanced handcuffied designs,
J. Combin. Theory, Ser. A 34 (1983), 60--70.
S. Tazawa,
Decomposition of a complete multipartite graph into isomorphic claws,
SIAM J. Algebraic Discrete Methods 6 (1985), 413--417.
M. Truszczynski,
Note on the decomposition of $ l K_{m,n}( l K^*_{m,n})$ into paths,
Discrete Math. 55 (1985), 89--96.
M. Truszczynski,
Decomposing graphs into forests of stars,
Congr. Numer. 54 (1986), 73--86.
H. Tverberg,
On the decomposition of $K_n$ into complete bipartite graphs,
J. Graph Theory 6 (1982), 493--494.
K. Ushio, S. Tazawa and S. Yamamoto,
On claw decomposition of complete multipartite graphs,
Hiroshima Math. J. 8 (1978), 207--210.
K. Ushio,
On balanced claw designs of complete multipartite graphs,
Discrete Math. 38 (1982), 117--119.
K. Ushio,
G-designs and related designs,
Discrete Math. 116 (1993), 299--311.
K. Ushio,
Star-factorization of symmetric complete bipartite digraphs,
Discrete Math. 167/168 (1997), 593--596.
K. Ushio,
$ hat{S_k}$-factorization of symmetric complete tripartite digraphs,
Discrete Math. 197/198 (1999), 791--799.
K. Ushio,
Cycle-factorization of symmetric complete tripartite digraphs,
Discrete Math. 199 (1999), 273--278.
K. Ushio,
$ bar{S_k}$-factorization of symmetric complete tripartite digraphs,
Discrete Math. 211 (2000), 281--286.
H. Wang,
On $K_{1,k}$-factorizations of a complete bipartite graph,
Discrete Math. 126 (1994), 359--364.
S. Yamamoto, H. Ikeda, S. Shige-eda, K. Ushio, and N. Hamada,
On claw-decomposition of complete graphs and complete bigraphs,
Hiroshima Math. J. 5 (1975), 33--42.
M.-L. Yu,
Resolvable tree designs,
J. Combin. Theory, Ser. A 61 (1992), 302--308.
M.-L. Yu,
On tree factorizations of $K_n$,
J. Graph Theory 17 (1993), 713--725.
M.-L. Yu,
On path factorizations of complete multipartite graphs,
Discrete Math. 122 (1993), 325--333. |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit