COVERING OF GRAPHS BY COMPLETE BIPARTITE SUBGRAPHS - COMPLEXITY OF 0-1-MATRICES

被引：46

作者：

TUZA, Z ^{[1
]}

机构：

[1] HUNGARIAN ACAD SCI,INST COMP & AUTOMAT,H-1111 BUDAPEST,HUNGARY

来源：

关键词：

D O I：

10.1007/BF02579163

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：111 / 116

页数：6

共 18 条

[1]

BERMOND JC, 1978, 10 U PAR SUD CTR ORS

[2]

BOLLOBAS B, 1976, MATH PROC CAMBRIDGE, V79, P19, DOI 10.1017/S0305004100052063

[3] ON THE COVERINGS OF GRAPHS [J].

CHUNG, FRK .

[4]

DEBRUIJN NG, 1948, NEDERL AKAD WETENSCH, V51, P1277

[5] REPRESENTATION OF A GRAPH BY SET INTERSECTIONS [J].

ERDOS, P ;

GOODMAN, AW ;

POSA, L .

CANADIAN JOURNAL OF MATHEMATICS, 1966, 18 (01) :106-&

[6]

Erdos P., 1959, CANADIAN J MATH, V11, P34

[7]

Erdos P., 1935, COMPOS MATH, V2, P463

[8] DISTANCE MATRIX POLYNOMIALS OF TREES [J].

GRAHAM, RL ;

LOVASZ, L .

[9] ON A PROBLEM OF KATONA,G.O.H. AND TARJAN,T [J].

GYORI, E ;

KOSTOCHKA, AV .

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1979, 34 (3-4) :321-327

[10]

Harary F., 1977, J GRAPH THEOR, V1, P131