STAR-CUTSETS AND PERFECT GRAPHS

被引：139

作者：

CHVATAL, V ^{[1
]}

机构：

[1] MCGILL UNIV,SCH COMP SCI,MONTREAL H3A 2T5,QUEBEC,CANADA

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1985年 / 39卷 / 03期

关键词：

D O I：

10.1016/0095-8956(85)90049-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：189 / 199

页数：11

共 50 条

[31] ARTICULATIONS SETS IN LINEAR PERFECT MATRICES .1. FORBIDDEN CONFIGURATIONS AND STAR CUTSETS (VOL 104, PG 23, 1992)
CONFORTI, M
RAO, MR
[J]. DISCRETE MATHEMATICS, 1993, 120 (1-3) : 309 - 309
[32] A generalization of perfect graphs - i-perfect graphs
Cai, LZ
Corneil, D
[J]. JOURNAL OF GRAPH THEORY, 1996, 23 (01) : 87 - 103
[33] Disjoint clique cutsets in graphs without long holes
Eschen, EM
Hoàng, CT
Petrick, MDT
Sritharan, R
[J]. JOURNAL OF GRAPH THEORY, 2005, 48 (04) : 277 - 298
[34] SOME RESULTS ON CIRCULAR PERFECT GRAPHS AND PERFECT GRAPHS
XU Baogang (School of Mathematics and Computer Science
[J]. Journal of Systems Science & Complexity, 2005, (02) : 167 - 173
[35] A PARALLEL ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHS
DEKEL, E
HU, J
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 20 (01) : 43 - 55
[36] On ωψ-Perfect Graphs
Araujo-Pardo, G.
Rubio-Montiel, C.
[J]. ARS COMBINATORIA, 2018, 141 : 375 - 387
[37] COMPLETE MULTI-PARTITE CUTSETS IN MINIMAL IMPERFECT GRAPHS
CORNUEJOLS, G
REED, B
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 59 (02) : 191 - 198
[38] THE TRAVELING SALESMAN PROBLEM IN GRAPHS WITH 3-EDGE CUTSETS
CORNUEJOLS, G
NADDEF, D
PULLEYBLANK, W
[J]. JOURNAL OF THE ACM, 1985, 32 (02) : 383 - 410
[39] CRITICAL PERFECT GRAPHS AND PERFECT 3-CHROMATIC GRAPHS
TUCKER, A
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1977, 23 (01) : 143 - 149
[40] ITERATIVE ALGORITHMS FOR GENERATING MINIMAL CUTSETS IN DIRECTED-GRAPHS
SHIER, DR
WHITED, DE
[J]. NETWORKS, 1986, 16 (02) : 133 - 147

← 1 2 3 4 5 →