Brian Alspach and his work
暂无分享,去创建一个
[1] Brian Alspach,et al. Elementary Proofs that Zp2 and Zp3 are CI-groups , 1999, Eur. J. Comb..
[2] C. C. Chen,et al. Characterization of a class of triangle-free graphs with a certain adjacency property , 1991, J. Graph Theory.
[3] Brian Alspach,et al. The hamilton spaces of cayley graphs on abelian groups , 1990, Discret. Math..
[4] Brian Alspach,et al. The Group of the Composition of two Tournaments , 1968 .
[5] Douglas R. Stinson,et al. The Oberwolfach problem and factors of uniform odd length cycles , 1989, J. Comb. Theory, Ser. A.
[6] Robert E. Woodrow,et al. Cycles and rays , 1990 .
[7] Brian Alspach,et al. Decomposing Complete Graphs Into Cycles of Length 2P , 1980 .
[8] Jonathan L. Gross,et al. Handbook of graph theory , 2007, Discrete mathematics and its applications.
[9] Brian Alspach. Cayley Graphs with Optimal Fault Tolerance , 1992, IEEE Trans. Computers.
[10] C. C. Chen,et al. On a class of Hamiltonian laceable 3-regular graphs , 1996, Discret. Math..
[11] Brian Alspach,et al. On Hamilton decompositions of prisms over simple 3-polytopes , 1986, Graphs Comb..
[12] Haodi Feng,et al. Orthogonal factorizations of graphs , 2002 .
[13] Cun-Quan Zhang,et al. Cycle covers of cubic multigraphs , 1993, Discret. Math..
[14] Brian Alspach,et al. Degree frequencies in digraphs and tournaments , 1978, J. Graph Theory.
[15] Brian Alspach,et al. Even cycle decompositions of complete graphs minus a 1-factor , 1994 .
[16] Brian Alspach,et al. Hamilton Cycles in Metacirculant Graphs with Prime Cardinality Blocks , 1985 .
[17] J. L. Berggren,et al. On the Determination of the Maximum Order of the Group of a Tournament , 1973, Canadian Mathematical Bulletin.
[18] Brian Alspach,et al. On the Density of Sets Containing No k-Element Arithmetic Progression of a Certain Kind , 1976 .
[19] Brian Alspach,et al. Edge partitions of the complete symmetric directed graph and related designs , 1981 .
[20] Brian Alspach,et al. Path decompositions of digraphs , 1974, Bulletin of the Australian Mathematical Society.
[21] Brian Alspach,et al. Cycle Decompositions of Kn and Kn-I , 2001, J. Comb. Theory, Ser. B.
[22] Brian Alspach,et al. On embedding triangle-free graphs in unit spheres , 1977, Discret. Math..
[23] L. Beineke,et al. Topics in algebraic graph theory , 2004 .
[24] Brian Alspach,et al. Paths and cycles in matroid base graphs , 1989, Graphs Comb..
[25] Brian Alspach,et al. Bypasses in asymmetric digraphs , 1974 .
[26] Brian Alspach,et al. A Construction for Vertex-Transitive Graphs , 1982, Canadian Journal of Mathematics.
[27] Brian Alspach,et al. Realization of certain generalized paths in tournaments , 1981 .
[28] Brian Alspach,et al. Realization of certain generalized paths in tournaments , 1981, Discret. Math..
[29] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[30] Brian Alspach,et al. Suborbit Structure of Permutation $p$ -Groups and an Application to Cayley Digraph Isomorphism , 2004, Canadian Mathematical Bulletin.
[31] Brian Alspach. A Combinatorial Proof of a Conjecture of Goldberg and Moon , 1968, Canadian Mathematical Bulletin.
[32] Guizhen Liu,et al. Orthogonal factorizations of graphs , 2002, J. Graph Theory.
[33] Helen Verrall,et al. Cycle decompositions IV: complete directed graphs and fixed length directed cycles , 2003, J. Comb. Theory, Ser. A.
[34] Brian Alspach. The search for long paths and cycles in vertex-transitive graphs and digraphs , 1981 .
[35] Brian Alspach,et al. Cycles of Each Length in Regular Tournaments , 1967, Canadian Mathematical Bulletin.
[36] Joy Morris,et al. Self-complementary circulant graphs , 1999, Ars Comb..
[37] B. Alspach. Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree☆ , 1973 .
[38] Cun-Quan Zhang,et al. Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups , 1996, SIAM J. Discret. Math..
[39] Brian Alspach,et al. Some observations on the oberwolfach problem , 1985, J. Graph Theory.
[40] Brian Alspach. Hamilton Cycles in Metacirculant Graphs with Prime Power Cardinal Blocks , 1988 .
[41] Brian Alspach,et al. Enumeration of Cayley graphs and digraph , 2002, Discret. Math..
[42] Dragan Marusic,et al. Nonseparable graphs with a given number of cycles , 1994, J. Graph Theory.
[43] B. Alspach,et al. Constructing graphs which are ½-transitive , 1994 .
[44] Brian Alspach. GRAPHS AND PERMUTATION GROUPS WHOSE TRANSITIVE CONSTITUENTS HAVE PRIME DEGREE * , 1979 .
[45] Spyros S. Magliveras,et al. Finite Geometries and Combinatorial Designs , 1990 .
[46] Brian Alspach,et al. On Hamiltonian Cycles in Metacirculant Graphs , 1982 .
[47] Peter Eades,et al. A lower-bound for the number of productions required for a certain class of languages , 1983, Discret. Appl. Math..
[48] Brian Alspach,et al. A Classification of 2-Arc-Transitive Circulants , 1996 .
[49] Jean-Claude Bermond,et al. Decomposition into Cycles I: Hamilton Decompositions , 1990 .
[50] Brian Alspach,et al. A Note on the Number of 4-Circuits in a Tournament , 1982 .
[51] Brian Alspach,et al. Elementary Proofs that Z 2 p and Z 3 p are CI-groups , 1999 .
[52] Brian Alspach,et al. VERTEX‐TRANSITIVE GRAPHS OF ORDER 2p , 1979 .
[53] Brian Alspach,et al. One-Factorizations of Tensor Products of Graphs , 1990 .
[54] Brian Alspach,et al. Enumeration of structural isomers in alicyclic hydrocarbons and in porphyrins , 1977 .
[55] Brian Alspach. The classification of hamiltonian generalized Petersen graphs , 1983, J. Comb. Theory, Ser. B.
[56] Douglas R Stinson,et al. Contemporary design theory : a collection of surveys , 1992 .
[57] Brian Alspach,et al. Isomorphism of circulant graphs and digraphs , 1979, Discret. Math..
[58] Brian Alspach,et al. Hamilton-Connected Cayley Graphs on Hamiltonian Groups , 2001, Eur. J. Comb..
[59] Brian Alspach,et al. Path numbers of tournaments , 1976 .
[60] Brian Alspach,et al. Isomorphism and Cayley graphs on abelian groups , 1997 .
[61] Brian Alspach,et al. Edge-pancyclic block-intersection graphs , 1991, Discret. Math..
[62] Brian Alspach,et al. Mutually disjoint families of 0-1 sequences , 1975, Discret. Math..
[63] Brian Alspach,et al. A result on Hamiltonian cycles in generalized Petersen graphs , 1981, J. Comb. Theory, Ser. B.
[64] Brian Alspach. On Point-Symmetric Tournaments , 1970, Canadian Mathematical Bulletin.
[65] Brian Alspach,et al. Decompositions of complete symmetric digraphs into the oriented pentagons , 1979 .
[66] B. Alspach,et al. 1/2-Transitive Graphs of Order 3p , 1994 .
[67] Brian Alspach. A 1-factorization of the line graphs of complete graphs , 1982, J. Graph Theory.
[68] Brian Alspach,et al. Lifting Hamilton cycles of quotient graphs , 1989, Discret. Math..
[69] Brian Alspach,et al. Graphs with the circuit cover property , 1994 .