메뉴 건너뛰기
Graphs and Combinatorics
Volumn 1, Issue 1, 1985, Pages 91-96
On graphs with small subgraphs of large chromatic number
Author keywords

[No Author keywords available]
Indexed keywords

EID: 51249176551     PISSN: 09110119     EISSN: 14355914     Source Type: Journal    
DOI: 10.1007/BF02582932     Document Type: Article
Times cited : (63)
References (3)
  • 1
    • 84933933702 scopus 로고    scopus 로고
    • Bollobás, B., Erdös, P., Simonovits, M., Szemerédi, E.: Extremal graphs without large forbidden subgraphs. In: Advances in Graph Theory (Cambridge Comb. Conf. Trinity College, 1977). Ann. Discrete Math. 3, 29–41 (1978)
  • 2
    • 84933933699 scopus 로고    scopus 로고
    • Erdös, P.: Problems and results of graphs and hypergraphs: similarities and differences. In: Recent Progress in Ramsey Theory, edited by Nešetřil, J., Rödl, V. (Proc. Third Czechoslovak Symposium on Graph Theory, Prague 1982)
  • 3
    • 84933933700 scopus 로고    scopus 로고
    • Szemerédi, E.: Regular partitions of graphs. Proc. Colloq. Int. C.N.R.S., pp. 399–401 (1976)

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