MINIMIZING THE JUMP NUMBER FOR PARTIALLY ORDERED SETS - A GRAPH-THEORETIC APPROACH

被引：26

作者：

SYSLO, MM

机构：

[1] UNIV WROCLAW,INST COMP SCI,PL-51151 WROCLAW,POLAND

[2] UNIV BONN,INST OKONOMETRIE & OPERAT RES,D-5300 BONN,FED REP GER

来源：

ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS | 1984年 / 1卷 / 01期

关键词：

D O I：

10.1007/BF00396269

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：7 / 19

页数：13

共 9 条

[1]

Behzad M., 1979, GRAPHS DIGRAPHS

[2]

Chein M, 1980, ANN DISCRETE MATH, V9, P189

[3]

COGIS O, 1979, RAIRO-INF THEOR-TH C, V13, P3

[4]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[5]

Hemminger R.L., 1978, SELECTED TOPICS GRAP, P271

[6]

PULLEYBLANK WR, 1981, UNPUB DISCRETE APPL

[7]

RIVAL I, UNPUB P AM MATH SOC

SYSLO, MM .

[9]

SYSLO MM, 1984, UNPUB DISCRETE APPL, V7