SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 19, Issue 4, 1999, Pages 473-486

Exact bounds for judicious partitions of graphs

(2) Bollobas B a,b Scott, A D a,b,c

a UNIVERSITY OF CAMBRIDGE (United Kingdom)

b University of Memphis (United States)

c UNIVERSITY COLLEGE LONDON (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039522014 PISSN: 02099683 EISSN: None Source Type: Journal
DOI: 10.1007/s004939970002 Document Type: Article

Times cited : (63)

References (17)

1
- 0041494491
- Bipartite subgraphs
- N. ALON: Bipartite subgraphs, Combinatorica, 16 (1996), 301-311.
- (1996) Combinatorica , vol.16 , pp. 301-311
- Alon, N.¹

2
- 0010957063
- On judicious partitions
- B. BOLLOBÁS and A. D. SCOTT: On judicious partitions, Period. Math. Hungar., 26 (1993), 127-139.
- (1993) Period. Math. Hungar. , vol.26 , pp. 127-139
- Bollobás, B.¹ Scott, A.D.²

3
- 0031120117
- On judicious partitions of hypergraphs
- B. BOLLOBÁS and A. D. SCOTT: On judicious partitions of hypergraphs, J. Combin. Theory Ser. A, 78 (1997), 15-31.
- (1997) J. Combin. Theory Ser. A , vol.78 , pp. 15-31
- Bollobás, B.¹ Scott, A.D.²

4
- 26544452775
- Judicious partitions of 3-uniform hypergraphs
- to appear
- B. BOLLOBÁS and A. D. SCOTT: Judicious partitions of 3-uniform hypergraphs, European J. Combin., to appear
- European J. Combin.
- Bollobás, B.¹ Scott, A.D.²

5
- 26544439236
- to appear
- B. BOLLOBÁS and A. D. SCOTT: Problems on judicious partitions, to appear.
- Problems on Judicious Partitions
- Bollobás, B.¹ Scott, A.D.²

6
- 0001301628
- Some extremal properties of bipartite graphs
- C. S. EDWARDS: Some extremal properties of bipartite graphs, Canadian J. Math., 25 (1973), 475-485.
- (1973) Canadian J. Math. , vol.25 , pp. 475-485
- Edwards, C.S.¹

7
- 0001896094
- An improved lower bound for the number of edges in a largest bipartite subgraph
- Prague
- C. S. EDWARDS: An improved lower bound for the number of edges in a largest bipartite subgraph, in Proc. 2nd Czechoslovak Symposium on Graph Theory, Prague 1975, 167-181.
- (1975) Proc. 2nd Czechoslovak Symposium on Graph Theory , pp. 167-181
- Edwards, C.S.¹

8
- 38249027516
- How to make a graph bipartite
- P. ERDO″S, R. FAUDREE, J. PACH and J. SPENCER: How to make a graph bipartite, J. Combin. Theory Ser. B, 45 (1988), 86-98.
- (1988) J. Combin. Theory Ser. B , vol.45 , pp. 86-98
- Erdos, P.¹ Faudree, R.² Pach, J.³ Spencer, J.⁴

9
- 0040915452
- The size of largest bipartite subgraphs
- P. ERDO″S, A. GYÁRFÁS and Y. KOHAYAKAWA: The size of largest bipartite subgraphs, Discrete Math., 177 (1997), 267-271.
- (1997) Discrete Math. , vol.177 , pp. 267-271
- Erdos, P.¹ Gyárfás, A.² Kohayakawa, Y.³

10
- 0041835276
- to appear
- T. HOFMEISTER and H. LEFMANN: On k-partite subgraphs, to appear.
- On k-Partite Subgraphs
- Hofmeister, T.¹ Lefmann, H.²

11
- 0040321493
- Triangle-free partial graphs and edge-covering theorems
- J. LEHEL and Zs. TUZA: Triangle-free partial graphs and edge-covering theorems, Discrete Math., 39 (1982), 59-65.
- (1982) Discrete Math. , vol.39 , pp. 59-65
- Lehel, J.¹ Tuza, Zs.²

12
- 0000375575
- Maximum k-colorable subgraphs
- S. C. LOCKE: Maximum k-colorable subgraphs, J. Graph Theory, 6 (1982), 123-132.
- (1982) J. Graph Theory , vol.6 , pp. 123-132
- Locke, S.C.¹

13
- 0037693104
- On a bottleneck conjecture of Erdo″s
- T. D. PORTER: On a bottleneck conjecture of Erdo″s, Combinatorica, 12 (1992), 317-321.
- (1992) Combinatorica , vol.12 , pp. 317-321
- Porter, T.D.¹

14
- 0038363022
- Graph partitions
- T. D. PORTER: Graph partitions, J. Combin. Math. Combin. Comp., 15 (1994), 111-118.
- (1994) J. Combin. Math. Combin. Comp. , vol.15 , pp. 111-118
- Porter, T.D.¹

15
- 0039729592
- to appear
- T. D. PORTER: Ars Combinatorta, to appear.
- Ars Combinatorta
- Porter, T.D.¹

16
- 0039729594
- personal communication
- T. D. PORTER: personal communication.
- Porter, T.D.¹

17
- 0040119275
- The complexity of the bottleneck graph bipartition problem
- F. SHAHROKHI and L. A. SZÉKELY: The complexity of the bottleneck graph bipartition problem, J. Combin. Math. Combin. Cormp., 15 (1994), 221-226.
- (1994) J. Combin. Math. Combin. Cormp. , vol.15 , pp. 221-226
- Shahrokhi, F.¹ Székely, L.A.²

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