ON MULTIPARTITE TOURNAMENTS

被引：15

作者：

GODDARD, WD

KUBICKI, G

OELLERMANN, OR

TIAN, S

机构：

[1] WESTERN MICHIGAN UNIV,KALAMAZOO,MI 49008

[2] UNIV NATAL,DURBAN,SOUTH AFRICA

[3] UNIV LOUISVILLE,LOUISVILLE,KY 40292

[4] CENT MISSOURI STATE UNIV,WARRENSBURG,MO 64093

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1991年 / 52卷 / 02期

关键词：

D O I：

10.1016/0095-8956(91)90069-V

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An n-partite tournament, n≥2, or multipartite tournament is an oriented graph obtained by orienting each edge of a complete n-partite graph. The cycle structure of multipartite tournaments is investigated and properties of vertices with maximum score are studied. © 1991.

引用

页码：284 / 300

页数：17

共 12 条

[1]

BAGGA KS, 1987, CZECH MATH J, V37, P323

[2]

BAGGA KS, 1989, ANN NEW YORK SCI, V555, P21

[3]

BAGGA KS, 1985, GRAPH THEORY ITS APP, P37

[4]

BAGGA KS, 1986, C NUMER, V53, P113

[5]

Beineke L. W., 1981, LONDON MATH SOC LECT, V52, P41

[6] CYCLES IN BIPARTITE TOURNAMENTS [J].

BEINEKE, LW ;

LITTLE, CHC .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1982, 32 (02) :140-145

[7]

BEINEKE LW, 1989, ANN NY ACAD SCI, V555, P32

[8]

BEINEKE LW, 1981, THEORY APPL GRAPHS, P55

[9]

CAMION P, 1959, CR HEBD ACAD SCI, V249, P2151

[10]

Chartrand Gary, 2016, GRAPHS DIGRAPHS, VSixth, DOI DOI 10.1201/B19731

← 1 2 →