See this document in CiteSeerX!

Kings in Semicomplete Multipartite Digraphs (1998)  (Make Corrections)  
Gregory Gutin, Anders Yeo



  Home/Search   Context   Related

Links:   ACM

 
View or download:
imada.sdu.dk/pub/papers/pp1...17.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  imada.ou.dk/Research/Prepri...gi (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete p-partite digraph, or just a semicomplete multipartite digraph. A semicomplete multipartite digraph with no cycle of length two is a multipartite tournament. In a digraph D, an r-king is a vertex q such that every vertex in D can be reached from q by a path of length at most r. Strengthening a theorem by K.M. Koh and B.P. Tan ... (Update)

Active bibliography (related documents):   More   All
2.3:   Generalizations of tournaments: A survey - Bang-Jensen, Gutin (1996)   (Correct)
1.9:   Survey of Anders Yeo's papers - In This   (Correct)
0.3:   Almost Minimum Diameter Orientations of Semicomplete.. - Gutin, Koh   (Correct)

Similar documents based on text:   More   All
1.2:   Longest Paths in Strong Spanning Oriented Subgraphs of Strong.. - Gutin, Yeo (1998)   (Correct)
1.1:   Sufficient Conditions for Semicomplete Multipartite.. - Guo, Tewes, Volkmann.. (1997)   (Correct)
1.1:   Note on the Path Covering Number of a Semicomplete Multipartite .. - Gutin, Yeo (1997)   (Correct)

BibTeX entry:   (Update)

@techreport{ gutin98kings,
    author = "Gregory Gutin and Anders Yeo",
    title = "Kings in Semicomplete Multipartite Digraphs",
    number = "PP-1998-17",
    month = "18,",
    year = "1998",
    url = "citeseer.ist.psu.edu/91290.html" }
Citations (may not include all citations):
126   Combinatorial Problems and Exercises (context) - Lov'asz - 1979
18   Cycles and paths in semicomplete multipartite digraphs (context) - Gutin - 1995
4   On multipartite tournaments (context) - Goddard, Kubicki et al. - 1991  ACM
4   generalizations and special topics (context) - Reid, scores - 1996
3   sources in complete multipartite digraphs (context) - Gutin - 1989
3   Kings in multipartite tournaments (context) - Koh, Tan - 1995  ACM
3   partite tournaments (context) - Petrovic, Thomassen et al. - 1991
2   The number of kings in a multipartite tournament (context) - Koh, Tan - 1997  ACM
2   partite tournaments (context) - Gutin, of - 1986
2   Kings in bipartite tournaments (context) - Petrovic - 1997  ACM
2   Number of 4-kings in bipartite tournaments with no 3-kings (context) - Koh, Tan - 1996  ACM

Documents on the same site (http://www.imada.ou.dk/Research/Preprints/g-i.html):   More
Quasi-Hamiltonicity: A Series of Necessary Conditions for a.. - Gutin, Yeo (1998)   (Correct)
Random Matrices with Complex Gaussian Entries - Haagerup, Thorbjørnsen (1998)   (Correct)
Random Matrices and K-theory for Exact.. - U. Haagerup, S.. (1998)   (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