메뉴 건너뛰기




Volumn 29, Issue 2, 1998, Pages 73-86

Matching Graphs

Author keywords

Distance graph; Matchings; Sequence of graphs

Indexed keywords


EID: 0032398827     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199810)29:2<73::AID-JGT3>3.0.CO;2-9     Document Type: Article
Times cited : (12)

References (5)
  • 1
    • 0041635656 scopus 로고
    • Convergent sequences of iterated H-line graphs
    • G. Chartrand, H. Gavlas, and M. Schultz, Convergent sequences of iterated H-line graphs, Discrete Math. 147 (1995), 73-86.
    • (1995) Discrete Math. , vol.147 , pp. 73-86
    • Chartrand, G.1    Gavlas, H.2    Schultz, M.3
  • 3
    • 0042688938 scopus 로고    scopus 로고
    • Subgraph distances in graphs defined by edge transfers
    • G. Chartrand, H. Hevia, E. B. Jarrett, and M. Schultz, Subgraph distances in graphs defined by edge transfers, Discrete Math. 170 (1997), 63-79.
    • (1997) Discrete Math. , vol.170 , pp. 63-79
    • Chartrand, G.1    Hevia, H.2    Jarrett, E.B.3    Schultz, M.4


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