메뉴 건너뛰기
Discrete Mathematics
Volumn 177, Issue 1-3, 1997, Pages 9-16
Duchet-type theorems for powers of HHD-free graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0042638746     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00370-6     Document Type: Article
Times cited : (5)
References (13)
  • 1
    • 38249014072 scopus 로고
    • Distance in cocomparability graphs and their powers
    • P. Damaschke, Distance in cocomparability graphs and their powers, Discrete Appl. Math. 35 (1992) 67-72.
    • (1992) Discrete Appl. Math. , vol.35 , pp. 67-72
    • Damaschke, P.1
  • 2
    • 85027522975 scopus 로고    scopus 로고
    • r-Dominating cliques in graphs with hypertree structure
    • Proc. 11th STACS, Caen, France, Springer Berlin
    • F.F. Dragan and A. Brandstädt, r-Dominating cliques in graphs with hypertree structure, Proc. 11th STACS, Caen, France, Lecture Notes in Computer Science, Vol. 775 (Springer Berlin, 1994) 735-746; Discrete Math. 162 (1996) 93-108.
    • (1994) Lecture Notes in Computer Science , vol.775 , pp. 735-746
    • Dragan, F.F.1    Brandstädt, A.2
  • 3
    • 85027522975 scopus 로고    scopus 로고
    • F.F. Dragan and A. Brandstädt, r-Dominating cliques in graphs with hypertree structure, Proc. 11th STACS, Caen, France, Lecture Notes in Computer Science, Vol. 775 (Springer Berlin, 1994) 735-746; Discrete Math. 162 (1996) 93-108.
    • (1996) Discrete Math. , vol.162 , pp. 93-108
  • 5
    • 0041636775 scopus 로고
    • Tech. Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-315
    • F.F. Dragan, F. Nicolai and A. Brandstädt, Powers of HHD-free graphs, Tech. Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-315, 1995.
    • (1995) Powers of HHD-free Graphs
    • Dragan, F.F.1    Nicolai, F.2    Brandstädt, A.3
  • 6
    • 0013525225 scopus 로고
    • Classical perfect graphs
    • P. Duchet, Classical perfect graphs, Ann. Discrete Math. 21 (1984) 67-96.
    • (1984) Ann. Discrete Math. , vol.21 , pp. 67-96
    • Duchet, P.1
  • 7
    • 30244484569 scopus 로고
    • Dissertation, Universität Hamburg
    • C. Flotow, Potenzen von Graphen, Dissertation, Universität Hamburg, 1995.
    • (1995) Potenzen von Graphen
    • Flotow, C.1
  • 8
    • 0043170021 scopus 로고
    • On powers of m-trapezoid graphs
    • C. Flotow, On powers of m-trapezoid graphs, Discrete Appl. Math. 63 (1995) 187-192.
    • (1995) Discrete Appl. Math. , vol.63 , pp. 187-192
    • Flotow, C.1
  • 9
    • 30244561769 scopus 로고
    • PhD Thesis, School of Computer Science, McGill Univ., Montreal
    • S. Olariu, Results on perfect graphs, PhD Thesis, School of Computer Science, McGill Univ., Montreal, 1986.
    • (1986) Results on Perfect Graphs
    • Olariu, S.1
  • 10
    • 0040797607 scopus 로고
    • Weak bipolarizable graphs
    • S. Olariu, Weak bipolarizable graphs. Discrete Math. 74 (1989) 159-171.
    • (1989) Discrete Math. , vol.74 , pp. 159-171
    • Olariu, S.1
  • 11
    • 11744380133 scopus 로고
    • An NC algorithm to Recognize HHD-free Graphs
    • S. Olariu, An NC Algorithm to Recognize HHD-free Graphs, Internat. J. Comput. Math. 31 (1990) 177-185.
    • (1990) Internat. J. Comput. Math. , vol.31 , pp. 177-185
    • Olariu, S.1
  • 12
    • 0042668942 scopus 로고
    • On powers of interval and unit interval graphs
    • A. Raychaudhuri, On powers of interval and unit interval graphs, Congr. Numer. 59 (1987) 235-242.
    • (1987) Congr. Numer. , vol.59 , pp. 235-242
    • Raychaudhuri, A.1
  • 13
    • 0142075416 scopus 로고
    • On powers of strongly chordal graphs and circular arc graphs
    • A. Raychaudhuri, On powers of strongly chordal graphs and circular arc graphs, Ars Combin. 34 (1992) 147-160.
    • (1992) Ars Combin. , vol.34 , pp. 147-160
    • Raychaudhuri, A.1

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