AAAAAA
Results:
1-11
|
Results: 11
Authors:
BANGJENSEN J
GUTIN G
YEO A
Citation: J. Bangjensen et al., PROPERLY COLORED HAMILTONIAN PATHS IN EDGE-COLORED COMPLETE GRAPHS, Discrete applied mathematics, 82(1-3), 1998, pp. 247-250
Authors:
BANGJENSEN J
GUTIN G
YEO A
Citation: J. Bangjensen et al., A POLYNOMIAL ALGORITHM FOR THE HAMILTONIAN CYCLE PROBLEM IN SEMICOMPLETE MULTIPARTITE DIGRAPHS, Journal of graph theory, 29(2), 1998, pp. 111-132
Authors:
BANGJENSEN J
GUTIN G
Citation: J. Bangjensen et G. Gutin, GENERALIZATIONS OF TOURNAMENTS - A SURVEY, Journal of graph theory, 28(4), 1998, pp. 171-202
Authors:
ALON N
GUTIN G
Citation: N. Alon et G. Gutin, PROPERLY COLORED HAMILTON CYCLES IN EDGE-COLORED COMPLETE GRAPHS, Random structures & algorithms, 11(2), 1997, pp. 179-186
Authors:
GUTIN G
YEO A
Citation: G. Gutin et A. Yeo, HAMILTONIAN PATHS AND CYCLES IN HYPERTOURNAMENTS, Journal of graph theory, 25(4), 1997, pp. 277-286
Authors:
GUTIN G
YEO A
Citation: G. Gutin et A. Yeo, RANKING THE VERTICES OF A COMPLETE MULTIPARTITE PAIRED-COMPARISON DIGRAPH, Discrete applied mathematics, 69(1-2), 1996, pp. 75-82
Authors:
BANGJENSEN J
GUTIN G
LI H
Citation: J. Bangjensen et al., SUFFICIENT CONDITIONS FOR A DIGRAPH TO BE HAMILTONIAN, Journal of graph theory, 22(2), 1996, pp. 181-187
Authors:
BLOKH D
GUTIN G
Citation: D. Blokh et G. Gutin, MAXIMIZING TRAVELING SALESMAN PROBLEM FOR SPECIAL MATRICES, Discrete applied mathematics, 56(1), 1995, pp. 83-86
Authors:
GUTIN G
Citation: G. Gutin, CYCLES AND PATHS IN SEMICOMPLETE MULTIPARTITE DIGRAPHS, THEOREMS, ANDALGORITHMS - A SURVEY, Journal of graph theory, 19(4), 1995, pp. 481-505
Authors:
GUTIN G
Citation: G. Gutin, FINDING A LONGEST PATH IN A COMPLETE MULTIPARTITE DIGRAPH, SIAM journal on discrete mathematics, 6(2), 1993, pp. 270-273
Authors:
GUTIN G
Citation: G. Gutin, ON CYCLES IN MULTIPARTITE TOURNAMENTS, J COMB TH B, 58(2), 1993, pp. 319-321
Risultati:
1-11
|