메뉴 건너뛰기




Volumn 135, Issue 1-3, 1994, Pages 103-111

Relating path coverings to vertex labellings with a condition at distance two

Author keywords

Hamilton path; Path covering; labelling

Indexed keywords


EID: 0038580940     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(93)E0098-O     Document Type: Article
Times cited : (132)

References (12)
  • 4
    • 84912975617 scopus 로고    scopus 로고
    • J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance two, SIAM J. Discrete Math., to appear.
  • 5
    • 0019213982 scopus 로고
    • Frequency assignment: theory and application
    • (1980) Proc. IEEE , vol.68 , pp. 1497-1514
    • Hale1
  • 9
    • 84912969401 scopus 로고    scopus 로고
    • F.S. Roberts, T-Colorings of graphs: recent results and open problems, Discrete Math., to appear.
  • 11
    • 84912972001 scopus 로고    scopus 로고
    • D. Sakai and C. Wang, No-hole (r + 1)-distant colorings, Discrete Appl. Math., to appear.
  • 12
    • 0346556554 scopus 로고
    • Hamiltonian circuits and path coverings of vertices in graphs
    • (1974) Colloq. Math. , vol.30 , pp. 295-316
    • Skupien1


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