12 Hits in 2.7 sec

Weakly Hamiltonian-connected ordinary multipartite tournaments

Jørgen Bang-Jensen, Gregory Gutin, Jing Huang
1995 Discrete Mathematics  
We characterize weakly Hamiltonian-connected ordinary multipartite tournaments.  ...  Our result generalizes such a characterization for tournaments by Thomassen and implies a polynomial algorithm to decide the existence ofa Hamiltonian path connecting two given vertices in an ordinary  ...  of tournaments, when we consider weakly Hamiltonian-connectedness.  ... 
doi:10.1016/0012-365x(94)00188-o fatcat:ljg6heqtubc5pkwoidbozrwwra

Multipartite tournaments: A survey

Lutz Volkmann
2007 Discrete Mathematics  
A multipartite or c-partite tournament is an orientation of a complete c-partite graph.  ...  In this survey we mainly describe results on directed cycles and paths in strongly connected c-partite tournaments for c 3. In addition, we include about 40 open problems and conjectures.  ...  [9] characterized weakly Hamiltonian-connected uniform multipartite tournaments.  ... 
doi:10.1016/j.disc.2007.03.053 fatcat:25sft4ap2zat5o3iocbum4w3zy

Cycles in multipartite tournaments: results and problems

Lutz Volkmann
2002 Discrete Mathematics  
A tournament is an orientation of a complete graph, and in general a multipartite tournament is an orientation of a complete n-partite graph.  ...  Many results about cycles in tournaments are known, but closely related problems involving cycles in multipartite tournaments have received little attention until recently.  ...  Characterize the family of all weakly Hamiltonian-connected multipartite tournaments. [12] ).  ... 
doi:10.1016/s0012-365x(01)00419-8 fatcat:rg3yfj4nazaj5afljiv4hbyrvq

Page 2607 of Mathematical Reviews Vol. , Issue 96e [page]

1996 Mathematical Reviews  
The authors characterize the weakly Hamilton-connected ordinary multipartite tournaments.  ...  (IL-TLAV; Tel Aviv); Huang, Jing (DK-ODNS-CS; Odense) Weakly Hamiltonian-connected ordinary multipartite tournaments. (English summary) 14th British Combinatorial Conference (Keele, 1993).  ... 

On Hamiltonian and Hamilton-connected digraphs [article]

S.Kh. Darbinyan
2018 arXiv   pre-print
Every 3-strongly connected digraph of order n and with minimum degree at least n+1 is strongly Hamiltonian-connected. 2.  ...  Let D be a 4-strongly connected digraph of order n such that the sum of the degrees of any pair of non-adjacent vertices is at least 2n+1. Then D is strongly Hamiltonian-connected.  ...  (ii) Bang-Jensen, Gutin and Huang [14] gave a characterization of weakly Hamiltonian-connected extended tournaments (ordinary multipartite tournaments).  ... 
arXiv:1801.05166v1 fatcat:eybft55zfjcutdq77qpm6ywlqa

Master index of volumes 131–140

1995 Discrete Mathematics  
Huang, Weakly Hamiltdnian-connected ordinary multipartite tournaments Bang-Jensen, J., P. Hell and G.  ...  ., A short proof of the d-connectedness of d-polytypes (Note) Batagelj, V., Inductive classes of bipartite cubic graphs Batbedat, A., 129-174 133 (1994) 181-190 132 (1994) 115-126 131 (1994) l-7 138  ... 
doi:10.1016/s0012-365x(00)80001-1 fatcat:3p4banfgz5bt3mddvnbajvmyqe

Master index of volumes 221-230

2001 Discrete Mathematics  
S [ olteH s, An extremal connectivity parameter of tournaments 223 (2000) 157}173 Knopfmacher, A. and H.  ...  ., Eventually rational and m-sparse points of linear ordinary di!erential operators with polynomial coe$cients 225 (2000) 3} 13 Adams, P., D.E. Bryant and A.  ... 
doi:10.1016/s0012-365x(01)00058-9 fatcat:xoeto3fhfra5dhyjrww2tymguu

Page 152 of Mathematical Reviews Vol. 28, Issue Index [page]

Mathematical Reviews  
M.; Huang, Jing) Weakly Hamiltonian-connected ordinary multipartite tournaments. (English summary) 96¢:05066 — (with Manoussakis, Yannis G.)  ...  Weakly Hamiltonian-connected vertices in bipartite tournaments. (English summary) 96f:05081 — Digraphs with the path-merging property.  ... 

Subject Index Volumes 1–200

2001 Discrete Mathematics  
claw free graph, 3582 Hamiltonian connected, 1133 Hamiltonian connected, , 1639 Hamiltonian connected, , 2381 Hamiltonian connected, , 2563 Hamiltonian connected, , 2937 , see also 805, 946, 1018,  ...  connected, 2468, 5053 component, 5273, 5965 digraph, 781 dominating set, 5303 weakly connected domination in a graph, 5303 number, 5303 weakly cyclic matrix, 1157 diamond free, 5106 dominating  ...  615, 4081, 4205 (n, 1)-transitive, 4415 tournament, 2301 (n, 2)-rounded matroid, 3013 (n, 3)-colourable graph, 5807 (n, 4)-colourable graph, 5807 (n, 4, 1)-DF, 4553 (n, 5, 1)-DF, 4553 (n, 5, 1)-PMD, 3330  ... 
doi:10.1016/s0012-365x(00)00471-4 fatcat:znxg54q6ifgutnhzj3urcw455y

Page 170 of Mathematical Reviews Vol. 32, Issue Index [page]

Mathematical Reviews  
(English summary) 2000¢:68019 Pan, Lingiang (with Zhou, Guofei; Zhang, Ke Min') A note on arc pancyclicity of regular ordinary multipartite tournaments.  ...  (English summary) 2000h:05076 Bu, Yue Hua (with Zhang, Ke Min') Completely strong path-connectivity of local tournaments.  ... 

Embedding graphs into larger graphs: results, methods, and problems [article]

Miklós Simonovits, Endre Szemerédi
2019 arXiv   pre-print
Some results discussed here got stronger emphasis, since they are connected to Lov\'asz (and sometimes to us).  ...  Multipartite case.  ...  For ordinary graphs the following theorem, connected to infinite Sidon sequences, was the starting point. Komlós, Szemerédi (1980) , [9, 10] ).  ... 
arXiv:1912.02068v1 fatcat:2rgpm6wbmvafta74cmcbbxhcs4

A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas Compiled by

Thomas Zaslavsky
1996 unpublished
There exist arbitrarily large sets of nonisomorphic, strongly cospectral connected graphs; also, of weakly connected digraphs, which moreover can be taken to be strongly connected, unilaterally connected  ...  There exist arbitrarily large sets of strictly quasicospectral digraphs, which moreover can be assumed strongly connected, weakly but not strongly connected, etc.  ...  For a graph, "parametrized dichromatic polynomial" ) , where G = graphic matroid and β 0 = number of connected components.  ...