Result 1 to 20 of 33 total
$n$-isofactorizations of 8-regular circulant graphs. (English)
J. Comb. Math. Comb. Comput. 72, 197-209 (2010).
1
Degree sequence conditions for partial Steiner triple systems. (English)
Bull. Inst. Comb. Appl. 57, 71-73 (2009).
2
6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable. (English)
Discrete Math. 309, No. 16, 5106-5110 (2009).
3
On orthogonal generalized equitable rectangles. (English)
Des. Codes Cryptography 51, No. 3, 225-230 (2009).
4
A parallel implementation for the maximum clique problem. (English)
J. Comb. Math. Comb. Comput. 63, 183-207 (2007).
5
On isomorphic factorizations of circulant graphs. (English)
J. Comb. Des. 14, No. 5, 406-414 (2006).
6
Graphs, algorithms, and optimization. (English)
Discrete Mathematics and its Applications. Boca Raton, FL: Chapman \& Hall/CRC (ISBN 1-58488-396-0/hbk). xv, 483~p. \$~89.95; \sterling~34.99 (2005).
7
Graphs, algorithms and optimization (English)
Graphs, algorithms and optimization, 1-481 (2005).
8
On PBIBD designs based on triangular schemes. (English)
Ann. Comb. 6, No.2, 147-155 (2002).
9
Pseudocode: A LATEX style file for displaying algorithms. (English)
Bull. Inst. Comb. Appl. 30, 11-24 (2000).
10
Combinatorial algorithms. Generation, enumeration, and search. (English)
CRC Press Series on Discrete Mathematics and its Applications. Boca Raton, FL: CRC Press. xii, 329 p. DM 123.00; öS 898.00; sFr. 112.00; \sterling 47.50; \$ 69.95 (1999).
11
Combinatorial algorithms: generation, enumeration, and search (English)
SIGACT News 30, No. 1, 33-35 (1999).
12
A graph decomposition theorem. (English)
5th international workshop on Algebraic and combinatorial coding theory. Sozopol, Bulgaria, June 1‒7, 1996. Proceedings. Shumen: UNICORN. 255 (1996).
13
A note on spanning trees in near $d$-angulations. (English)
Ars Comb. 41, 189-192 (1995).
14
Partial Steiner triple systems with equal-sized holes (English)
J. Comb. Theory, Ser. A 70, No. 1, 56-65 (1995).
15
Yet another characterization of the Petersen graph. (English)
Bull. Inst. Comb. Appl. 7, 73-77 (1993).
16
The parameters 4-(12,6,6) and related $t$-designs. (English)
Australas. J. Comb. 7, 3-20 (1993).
17
Minimum triangle-free graphs. (English)
Ars Comb. 31, 65-92 (1991).
18
A Turán problem for Cartesian products of hypergraphs. (English)
J. Comb. Math. Comb. Comput. 8, 17-25 (1990).
19
Constructing 6-(14,7,4) designs. (English)
Finite geometries and combinatorial designs, Proc. AMS Spec. Sess., Lincoln/NE (USA) 1987, Contemp. Math. 111, 137-151 (1990).
20
Result 1 to 20 of 33 total
Start
Contact
Print
General Help
