메뉴 건너뛰기
Combinatorica
Volumn 19, Issue 2, 1999, Pages 267-296
Mangoes and blueberries
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0038929410     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050056     Document Type: Article
Times cited : (100)
References (15)
  • 1
    • 0007373085 scopus 로고
    • Unboundedness for generalized odd cycle traversability and a Gallai conjecture
    • Puerto Rico
    • I. DEJTER and V. NEUMANN-LARA: Unboundedness for generalized odd cycle traversability and a Gallai conjecture, paper presented at the Fourth Caribbean Conference on Computing, Puerto Rico, 1985.
    • (1985) Fourth Caribbean Conference on Computing
    • Dejter, I.1    Neumann-Lara, V.2
  • 2
    • 0001387789 scopus 로고
    • A decomposition theorem for partially ordered sets
    • R. DILWORTH: A decomposition theorem for partially ordered sets, Annals of Mathematics, 51 (1950), 161-166.
    • (1950) Annals of Mathematics , vol.51 , pp. 161-166
    • Dilworth, R.1
  • 3
    • 0001428054 scopus 로고
    • On independent circuits contained in a graph
    • P. ERDOS and L. PÓSA: On independent circuits contained in a graph, Canadian J. Math., 17 (1965), 347-352.
    • (1965) Canadian J. Math. , vol.17 , pp. 347-352
    • Erdos, P.1    Pósa, L.2
  • 6
    • 0003164676 scopus 로고    scopus 로고
    • Tree width and tangles: A new connectivity measure and some applications
    • Surveys in Combinatorics
    • B. REED: Tree width and tangles: a new connectivity measure and some applications, in: Surveys in Combinatorics, London Math Society Lecture Notes 241 (1997), 87-163.
    • (1997) London Math Society Lecture Notes , vol.241 , pp. 87-163
    • Reed, B.1
  • 7
  • 8
    • 45449125778 scopus 로고
    • Graph minors. VII. Disjoint paths on a surface
    • N. ROBERTSON and P. D. SEYMOUR: Graph Minors. VII. Disjoint paths on a surface, J. Combin. Theory Ser. B, 45 (1988), 212-254.
    • (1988) J. Combin. Theory Ser. B , vol.45 , pp. 212-254
    • Robertson, N.1    Seymour, P.D.2
  • 9
    • 0001227241 scopus 로고
    • Graph minors. X. Obstructions to tree-decomposition
    • N. ROBERTSON and P. D. SEYMOUR: Graph Minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), 153-190.
    • (1991) J. Combin. Theory Ser. B , vol.52 , pp. 153-190
    • Robertson, N.1    Seymour, P.D.2
  • 10
    • 0002848005 scopus 로고
    • Graph minors. XIII. The disjoint paths problem
    • N. ROBERTSON and P. D. SEYMOUR: Graph Minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B, 63 (1995), 65-110.
    • (1995) J. Combin. Theory Ser. B , vol.63 , pp. 65-110
    • Robertson, N.1    Seymour, P.D.2
  • 12
    • 44949266653 scopus 로고
    • Graph searching and a min-max theorem for tree-width
    • P. D. SEYMOUR and R. THOMAS: Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B, 58 (1993), 22-33.
    • (1993) J. Combin. Theory Ser. B , vol.58 , pp. 22-33
    • Seymour, P.D.1    Thomas, R.2
  • 13
    • 0001084179 scopus 로고
    • Disjoint paths in graphs
    • P. SEYMOUR: Disjoint paths in Graphs, Discrete Mathematics, 29 (1980), 293-309.
    • (1980) Discrete Mathematics , vol.29 , pp. 293-309
    • Seymour, P.1
  • 15
    • 84986465543 scopus 로고
    • On the presence of disjoint subgraphs of a specified type
    • C. THOMASSEN: On the presence of disjoint subgraphs of a specified type, J. Graph Theory, 12 (1988), 101-111.
    • (1988) J. Graph Theory , vol.12 , pp. 101-111
    • Thomassen, C.1

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