Jørgen Bang-Jensen, Gregory Gutin, Jing Huang  Home/Search
Context Related
| brunel.ac.uk/maths/pub/suf2.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: densis.fee.unicamp.br/...Hamilton (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of a digraph D is a collection of vertex disjoint cycles covering all the vertices of D. We show that there is no degree of strong connectivity which together with the existence of a factor will guarantee that a multipartite tournament is Hamiltonian. Our main result is a sufficient condition for a multipartite tournament to be Hamiltonian. We show that this condition is general enough to provide... (Update)
Context of citations to this paper: More
.... are not Hamiltonian (see for example figure 1) The first non trivial sufficient condition for a SMD to be Hamiltonian was in the paper [20], by Bang Jensen, Gutin and Huang, which was extended to a considerably stronger result in h3i. Even though there still is no nice...
...the affirmative. To prove the existens of such algorithms, we use the main result from [16] by Yeo, which in turn uses the results from [2] by Bang Jensen, Gutin and Huang. The main result obtained in [16] has many other nice consequences: Every diregular SMD is Hamiltonian. If...
Cited by: More
A Polynomial Algorithm for Finding a Cycle Covering a Given Set of.. - Yeo (1998) (Correct)
Semicomplete Multipartite Digraphs - Yeo (1998) (Correct)
Active bibliography (related documents): More All
1.0: Alternating Cycles and Paths in Edge-Coloured Multigraphs - Bang-Jensen, Gutin (1995) (Correct)
1.0: Cycles in Semicomplete Multipartite Digraphs - Yeo (1996) (Correct)
0.8: On the Complexity of Hamiltonian Path and Cycle Problems in .. - Bang-Jensen, Gutin (1997) (Correct)
Similar documents based on text: More All
0.9: Kings in Semicomplete Multipartite Digraphs - Gutin, Yeo (1998) (Correct)
0.7: Sufficient Conditions for Semicomplete Multipartite.. - Guo, Tewes, Volkmann.. (1997) (Correct)
0.7: Survey of Anders Yeo's papers - In This (Correct)
Related documents from co-citation: More All
2: A criterion for complete bipartite digraphs to be Hamiltonian (context) - Gutin - 1984
2: Graph Theory with Applications (context) - Bondy, Murty - 1976
2: Weakly Hamiltonian-connected vertices in bipartite tournaments (context) - Bang-Jensen, Manoussakis - 1995
BibTeX entry: (Update)
J. Bang-Jensen, G. Gutin and J. Huang, A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, Discrete Math. 163 (1997) no. 1-3, 217-223. http://citeseer.ist.psu.edu/bang-jensen97sufficient.html More
@misc{ bang-jensen97sufficient,
author = "J. Bang-Jensen and G. Gutin and J. Huang",
title = "A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian",
text = "J. Bang-Jensen, G. Gutin and J. Huang, A sufficient condition for a semicomplete
multipartite digraph to be Hamiltonian, Discrete Math. 163 (1997) no. 1-3,
217-223.",
year = "1997",
url = "citeseer.ist.psu.edu/bang-jensen97sufficient.html" }
Citations (may not include all citations):537 Graph Theory with Applications (context) - Bondy, Murty - 1976
32 Rinehart and Winston (context) - Moon, Tournaments - 1968
23 Selected Topics in Graph Theory (context) - Beineke, Wilson - 1988
18 Cycles and paths in bipartite tournaments with spanning conf.. (context) - Haggkvist, Manoussakis - 1989
18 Cycles and paths in semicomplete multipartite digraphs (context) - Gutin
17 A criterion for complete bipartite digraphs to be Hamiltonia.. (context) - Gutin - 1984
16 One-diregular subgraphs in semicomplete multipartite digraph.. - Yeo
11 Finding a longest path in a complete multipartite digraph (context) - Gutin - 1993
11 Tel Aviv Univ (context) - Gutin, cycles et al. - 1993
10 partite digraphs that have a Hamiltonian path (context) - Gutin, of et al. - 1988
9 A polynomial algorithm for the 2-path problem for semicomple.. (context) - Bang-Jensen, Thomassen - 1992
7 Disconnected orientations and a conjecture of Las Vergnas (context) - Bondy - 1976
5 Hamilton paths in multipartite oriented graphs (context) - Zhang - 1989
3 Effective characterization of complete bipartite digraphs th.. (context) - Gutin - 1985
2 A tour through tournaments or bipartite and ordinary tournam.. (context) - Beineke - 1981
1 A linear algorithm for finding Hamiltonian cycles in tournam.. (context) - Manoussakis - 1992
Documents on the same site (http://www.densis.fee.unicamp.br/~moscato/Hamilton.html): More
Paths and Cycles in Extended and Decomposable Digraphs - Bang-Jensen, Gutin (1997) (Correct)
Properly colored Hamilton cycles in edge colored complete graphs - Alon, Gutin (Correct)
Characterizations Of Vertex Pancyclic And Pancyclic Ordinary.. - Gutin, Sackler (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC