메뉴 건너뛰기




Volumn 270, Issue 1-3, 2003, Pages 227-240

On reorienting graphs by pushing down maximal vertices - II

Author keywords

Flow difference; Graph; Lattice; Orientation; Pushing down

Indexed keywords

FUNCTIONS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

EID: 0042531834     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00160-2     Document Type: Article
Times cited : (8)

References (9)
  • 1
    • 0037119068 scopus 로고    scopus 로고
    • Coding distributive lattices with edge firing games
    • Latapy M., Magnien C. Coding distributive lattices with edge firing games. Inform. Process. Lett. 83:2002;125-128.
    • (2002) Inform. Process. Lett. , vol.83 , pp. 125-128
    • Latapy, M.1    Magnien, C.2
  • 2
    • 0042284907 scopus 로고
    • Inversions, cuts and orientations
    • Liu W.P., Rival I. Inversions, cuts and orientations. Discrete Math. 87:1991;163-174.
    • (1991) Discrete Math. , vol.87 , pp. 163-174
    • Liu, W.P.1    Rival, I.2
  • 3
    • 0002493594 scopus 로고
    • Strongly basable graphs
    • Armenian with Russian Summary
    • Mosesian K.M. Strongly basable graphs. Akad. Nauk. Armian SSR Dokl. 54:1972;134-138. (Armenian with Russian Summary).
    • (1972) Akad. Nauk. Armian SSR Dokl. , vol.54 , pp. 134-138
    • Mosesian, K.M.1
  • 4
    • 0002493595 scopus 로고
    • Some theorems on strongly basable graphs
    • Armenian with Russian Summary
    • Mosesian K.M. Some theorems on strongly basable graphs. Akad. Nauk. Armian SSR Dokl. 54:1972;241-245. (Armenian with Russian Summary).
    • (1972) Akad. Nauk. Armian SSR Dokl. , vol.54 , pp. 241-245
    • Mosesian, K.M.1
  • 5
    • 0002493592 scopus 로고
    • Basable and strongly basable graphs
    • Armenian with Russian Summary
    • Mosesian K.M. Basable and strongly basable graphs. Akad. Nauk. Armian SSR Dokl. 55:1972;83-86. (Armenian with Russian Summary).
    • (1972) Akad. Nauk. Armian SSR Dokl. , vol.55 , pp. 83-86
    • Mosesian, K.M.1
  • 6
    • 0010782341 scopus 로고
    • On graphs that can be oriented as diagrams of ordered sets
    • Pretzel O. On graphs that can be oriented as diagrams of ordered sets. Order. 2:1985;25-40.
    • (1985) Order , vol.2 , pp. 25-40
    • Pretzel, O.1
  • 7
    • 0001129917 scopus 로고
    • On reorienting graphs by pushing down maximal vertices
    • Pretzel O. On reorienting graphs by pushing down maximal vertices. Order. 3:1986;135-152.
    • (1986) Order , vol.3 , pp. 135-152
    • Pretzel, O.1
  • 8
    • 0042786032 scopus 로고
    • Cycle lengths and graph orientations
    • Pretzel O., Youngs D. Cycle lengths and graph orientations. SIAM J. Discrete Math. 3:1991;544-553.
    • (1991) SIAM J. Discrete Math. , vol.3 , pp. 544-553
    • Pretzel, O.1    Youngs, D.2


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