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

메뉴 건너뛰기

Discrete Mathematics

Volumn 24, Issue 3, 1978, Pages 311-314

Chromatic number, girth and maximal degree

(1) Bollobás, Béla a

a UNIVERSITY OF CAMBRIDGE (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012830818 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/0012-365X(78)90102-4 Document Type: Article

Times cited : (51)

References (9)

1
- 84910290859
- Academic Press, New York
- (1978) Extremal Graph Thepry
- Bollobás¹

2
- 84910279191
- O.V. Borodin and A.V. Kostochka, On an upper bound of the graph's chromatic number depending on the graph's degree and density.

3
- 84910246376
- P.A. Catlin, A bound on the chromatic number of graphs, J. Combinatorial Theory Ser. B (to appear).

4
- 0042592000
- A three colour problem
- Solution, March 1948
- (1947) Eureka
- Descartes¹

5
- 0001325634
- 4526
- proposed by P. Ungar
- (1954) The American Mathematical Monthly , vol.61 , pp. 352
- Descartes¹

6
- 0001869610
- Graph theory and probability
- (1959) Canadian Journal of Mathematics , vol.11 , pp. 34-38
- Erdös¹

7
- 26344465557
- On colouring problems (in Hungarian)
- (1965) Mat. Lapok , vol.16 , pp. 274-277
- Gerencsér¹

8
- 1842617122
- A Problem in Graph Coloring
- (1970) The American Mathematical Monthly , vol.77 , pp. 1088-1092
- Grünbaum¹

9
- 0013497816
- On decomposition of graphs
- (1966) Studia Sci. Math. Hungar. , vol.1 , pp. 237-238
- Lovász¹

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