ON THE P4-STRUCTURE OF PERFECT GRAPHS .2. ODD DECOMPOSITIONS

被引：12
|
作者：
HOANG, CT [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)90052-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：220 / 232
页数：13
相关论文
共 50 条
  • [1] ON THE P4-STRUCTURE OF PERFECT GRAPHS .3. PARTNER DECOMPOSITIONS
    CHVATAL, V
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1987, 43 (03) : 349 - 353
  • [2] ON THE P4-STRUCTURE OF PERFECT GRAPHS .1. EVEN DECOMPOSITIONS
    CHVATAL, V
    HOANG, CT
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 39 (03) : 209 - 219
  • [3] ON THE P4-STRUCTURE OF PERFECT GRAPHS .4. PARTNER GRAPHS
    HAYWARD, RB
    LENHART, WJ
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 48 (01) : 135 - 139
  • [4] Recognizing the P4-structure of bipartite graphs
    Babel, L
    Brandstädt, A
    Le, VB
    [J]. DISCRETE APPLIED MATHEMATICS, 1999, 93 (2-3) : 157 - 168
  • [5] Recognizing the P4-structure of block graphs
    Brandstädt, A
    Le, VB
    [J]. DISCRETE APPLIED MATHEMATICS, 2000, 99 (1-3) : 349 - 366
  • [6] Recognizing the P4-structure of claw-free graphs and a larger graph class
    Babel, L
    Brandstädt, A
    Le, V
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2002, 5 (01): : 127 - 146
  • [7] Efficiently Recognizing the P4-Structure of Trees and of Bipartite Graphs Without Short Cycles
    Andreas Brandstädt
    Van Bang Le
    Stephan Olariu
    [J]. Graphs and Combinatorics, 2000, 16 : 381 - 387
  • [8] Efficiently recognizing the P4-structure of trees and of bipartite graphs without short cycles
    Brandstädt, A
    Le, VB
    Olariu, S
    [J]. GRAPHS AND COMBINATORICS, 2000, 16 (04) : 381 - 387
  • [9] Perfect graphs with unique P-4-structure
    Hougardy, S
    [J]. DISCRETE MATHEMATICS, 1997, 165 : 421 - 430
  • [10] Polynomial time recognition of P4-structure
    Hayward, RB
    Hougardy, S
    Reed, BA
    [J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 382 - 389
12345