메뉴 건너뛰기




Volumn 68, Issue 1-2, 1996, Pages 73-84

The algorithmic complexity of minus domination in graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0013174601     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00056-W     Document Type: Article
Times cited : (44)

References (8)
  • 2
    • 0042718024 scopus 로고
    • Dominating sets in chordal graphs
    • K.S. Booth and J.H. Johnson, Dominating sets in chordal graphs, SIAM J. Comput. 11 (1982) 191-199.
    • (1982) SIAM J. Comput. , vol.11 , pp. 191-199
    • Booth, K.S.1    Johnson, J.H.2
  • 4
    • 0010757758 scopus 로고
    • Contributions to the theory of domination, independence and irredundance in graphs
    • E.J. Cockayne, O. Favaron, C. Payan and A. Thomason, Contributions to the theory of domination, independence and irredundance in graphs, Discrete Math. 33 (1981) 249-258.
    • (1981) Discrete Math. , vol.33 , pp. 249-258
    • Cockayne, E.J.1    Favaron, O.2    Payan, C.3    Thomason, A.4
  • 8
    • 0002709349 scopus 로고
    • Chordal graphs and upper irredundance, upper domination and independence
    • M.S. Jacobson and K. Peters, Chordal graphs and upper irredundance, upper domination and independence. Discrete Math. 86 (1990) 59-69.
    • (1990) Discrete Math. , vol.86 , pp. 59-69
    • Jacobson, M.S.1    Peters, K.2


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