A FAMILY OF PERFECT GRAPHS ASSOCIATED WITH DIRECTED-GRAPHS

被引:0
作者
KAHN, J
机构
[1] MIT,CAMBRIDGE,MA 02139
[2] RUTGERS STATE UNIV,NEW BRUNSWICK,NJ 08903
关键词
D O I
10.1016/0095-8956(84)90060-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:279 / 282
页数:4
相关论文
共 12 条
[1]  
Berge C., 1973, GRAPHS HYPERGRAPHS, V7
[2]   COMBINATORIAL DESIGNS RELATED TO THE STRONG PERFECT GRAPH CONJECTURE [J].
CHVATAL, V ;
GRAHAM, RL ;
PEROLD, AF ;
WHITESIDES, SH .
DISCRETE MATHEMATICS, 1979, 26 (02) :83-92
[3]  
Edmonds J., 1975, ANN DISCRETE MATH, V1, P185
[4]  
FEOFILOFF P, DIRECTED CUT TRANSVE
[5]  
Golumbic M. C., 1980, ALGORITHMIC GRAPH TH
[6]  
Lovasz L., 1972, J COMBIN THEORY B, V13, P95, DOI DOI 10.1016/0095-8956(72)90045-7
[7]  
LOVASZ L, 1976, J COMB THEORY B, V2, P96
[8]   MINIMAX THEOREM FOR DIRECTED GRAPHS [J].
LUCCHESI, CL ;
YOUNGER, DH .
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1978, 17 (JUN) :369-374
[9]  
Padberg MW, 1974, MATH PROGRAMMING, V6, P180, DOI [10.1007/BF01580235, DOI 10.1007/BF01580235]
[10]   A COUNTEREXAMPLE TO A CONJECTURE OF EDMONDS AND GILES [J].
SCHRIJVER, A .
DISCRETE MATHEMATICS, 1980, 32 (02) :213-214