메뉴 건너뛰기
Discrete Mathematics
Volumn 199, Issue 1-3, 1999, Pages 245-249
Independent branchings in acyclic digraphs
Author keywords

Branchings
Indexed keywords

EID: 0042207081     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00338-0     Document Type: Article
Times cited : (6)
References (7)
  • 1
    • 33746367951 scopus 로고
    • Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
    • J. Cheriyan, S.N. Maheshwari, Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs, J. Algorithms 9 (1988) 507-537.
    • (1988) J. Algorithms , vol.9 , pp. 507-537
    • Cheriyan, J.1    Maheshwari, S.N.2
  • 2
    • 0002167079 scopus 로고
    • Submodular functions, matroids and certain polyhedra
    • R. Guy et al. (Ed.), Gordon and Breach, New York
    • J. Edmonds, Submodular functions, matroids and certain polyhedra, in: R. Guy et al. (Ed.), Combinarotial Structures and their Applications, Gordon and Breach, New York, 1969, pp. 69-87.
    • (1969) Combinarotial Structures and Their Applications , pp. 69-87
    • Edmonds, J.1
  • 3
    • 0038183140 scopus 로고
    • Independent trees in graphs
    • A. Huck, Independent trees in graphs, Graphs Combin. 10 (1994) 29-45.
    • (1994) Graphs Combin. , vol.10 , pp. 29-45
    • Huck, A.1
  • 4
    • 84987554964 scopus 로고
    • Disproof of a conjecture about independent branchings in k-connected directed graphs
    • A. Huck, Disproof of a conjecture about independent branchings in k-connected directed graphs, J. Graph Theory 20 (1995) 235-239.
    • (1995) J. Graph Theory , vol.20 , pp. 235-239
    • Huck, A.1
  • 5
    • 0021542548 scopus 로고
    • The multi-tree approach to reliability in distributed networks
    • on Foundations of Computer Sciences
    • A. Itai, R. Rodeh, The multi-tree approach to reliability in distributed networks, in: Proc. 25th Annu. IEEE Symp. on Foundations of Computer Sciences, 1984, pp. 137-147.
    • (1984) Proc. 25th Annu. IEEE Symp. , pp. 137-147
    • Itai, A.1    Rodeh, R.2
  • 6
    • 0042512955 scopus 로고
    • Fractional packing and covering
    • A. Schrijver (Ed.), Mathematical Centrum, Amsterdam
    • A. Schrijver, Fractional packing and covering, in: A. Schrijver (Ed.), Packing and Covering in Combinatorics, Mathematical Centrum, Amsterdam, 1979.
    • (1979) Packing and Covering in Combinatorics
    • Schrijver, A.1
  • 7
    • 84986468106 scopus 로고
    • Vertex-disjoint paths and edge-disjoint branchings in directed graphs
    • R.W. Whitty, Vertex-disjoint paths and edge-disjoint branchings in directed graphs, J. Graph Theory 11 (1987) 349-358.
    • (1987) J. Graph Theory , vol.11 , pp. 349-358
    • Whitty, R.W.1

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