메뉴 건너뛰기




Volumn E85-D, Issue 7, 2002, Pages 1065-1073

Counting graph isomorphisms among chordal graphs with restricted clique number

Author keywords

Chordal graph; Clique number; Graph isomorphism; Tree model

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; POLYNOMIALS;

EID: 0036630887     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (1)

References (14)
  • 3
    • 0001078822 scopus 로고
    • Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
    • (1990) J. Algorithms , vol.11 , Issue.4 , pp. 631-643
    • Bodlaender, H.L.1


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