AAAAAA

   
Results: 1-12 |
Results: 12
PROPERLY COLORED HAMILTONIAN PATHS IN EDGE-COLORED COMPLETE GRAPHS
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
EDGE-CONNECTIVITY AUGMENTATION PRESERVING SIMPLICITY
Authors: BANGJENSEN J JORDAN T
Citation: J. Bangjensen et T. Jordan, EDGE-CONNECTIVITY AUGMENTATION PRESERVING SIMPLICITY, SIAM journal on discrete mathematics (Print), 11(4), 1998, pp. 603-623
A POLYNOMIAL ALGORITHM FOR THE HAMILTONIAN CYCLE PROBLEM IN SEMICOMPLETE MULTIPARTITE DIGRAPHS
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
GENERALIZATIONS OF TOURNAMENTS - A SURVEY
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
PARALLEL ALGORITHMS FOR THE HAMILTONIAN CYCLE AND HAMILTONIAN PATH PROBLEMS IN SEMICOMPLETE BIPARTITE DIGRAPHS
Authors: BANGJENSEN J ELHADDAD M MANOUSSAKIS Y PRZYTYCKA TM
Citation: J. Bangjensen et al., PARALLEL ALGORITHMS FOR THE HAMILTONIAN CYCLE AND HAMILTONIAN PATH PROBLEMS IN SEMICOMPLETE BIPARTITE DIGRAPHS, Algorithmica, 17(1), 1997, pp. 67-87
SUFFICIENT CONDITIONS FOR A DIGRAPH TO BE HAMILTONIAN
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
WEAKLY HAMILTONIAN-CONNECTED LOCALLY SEMICOMPLETE DIGRAPHS
Authors: BANGJENSEN J GUO YB VOLKMANN L
Citation: J. Bangjensen et al., WEAKLY HAMILTONIAN-CONNECTED LOCALLY SEMICOMPLETE DIGRAPHS, Journal of graph theory, 21(2), 1996, pp. 163-172
PRESERVING AND INCREASING LOCAL EDGE-CONNECTIVITY IN MIXED GRAPHS
Authors: BANGJENSEN J FRANK A JACKSON B
Citation: J. Bangjensen et al., PRESERVING AND INCREASING LOCAL EDGE-CONNECTIVITY IN MIXED GRAPHS, SIAM journal on discrete mathematics, 8(2), 1995, pp. 155-178
QUASI-TRANSITIVE DIGRAPHS
Authors: BANGJENSEN J HUANG J
Citation: J. Bangjensen et J. Huang, QUASI-TRANSITIVE DIGRAPHS, Journal of graph theory, 20(2), 1995, pp. 141-161
DIGRAPHS WITH THE PATH-MERGING PROPERTY
Authors: BANGJENSEN J
Citation: J. Bangjensen, DIGRAPHS WITH THE PATH-MERGING PROPERTY, Journal of graph theory, 20(2), 1995, pp. 255-265
WEAKLY HAMILTONIAN-CONNECTED VERTICES IN BIPARTITE TOURNAMENTS
Authors: BANGJENSEN J MANOUSSAKIS Y
Citation: J. Bangjensen et Y. Manoussakis, WEAKLY HAMILTONIAN-CONNECTED VERTICES IN BIPARTITE TOURNAMENTS, J COMB TH B, 63(2), 1995, pp. 261-280
IN-TOURNAMENT DIGRAPHS
Authors: BANGJENSEN J HUANG J PRISNER E
Citation: J. Bangjensen et al., IN-TOURNAMENT DIGRAPHS, J COMB TH B, 59(2), 1993, pp. 267-287
Risultati: 1-12 |