메뉴 건너뛰기




Volumn 55, Issue 3, 1985, Pages 245-254

Compositions for perfect graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 40349095717     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(85)80001-7     Document Type: Article
Times cited : (57)

References (11)
  • 3
    • 0006997752 scopus 로고
    • A composition for perfect graphs
    • C. Berge, V. Chvátal, Ann. Discrete Math., North-Holland, Amsterdam
    • (1984) Topics on Perfect Graphs , vol.21 , pp. 221-224
    • Bixby1
  • 4
    • 0000213573 scopus 로고
    • Polynomial algorithm to recognize a Meyniel graph
    • C. Berge, V. Chvátal, Ann. Discrete Math., North-Holland, Amsterdam
    • (1984) Topics on Perfect Graphs , vol.21 , pp. 225-252
    • Burlet1    Fonlupt2
  • 6
    • 0012830839 scopus 로고
    • A combinatorial decomposition theory
    • University of Waterloo, Winnipeg, Canada
    • (1973) Thesis
    • Cunningham1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.