MINIMAL 5-CHROMATIC TRIANGLE-FREE GRAPHS

被引:1
作者
AVIS, D
机构
关键词
D O I
10.1002/jgt.3190030411
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
It is shown that the minimum number of vertices in a triangle‐free 5‐chromatic graph is at least 19. Copyright © 1979 Wiley Periodicals, Inc., A Wiley Company
引用
收藏
页码:397 / 400
页数:4
相关论文
共 5 条
[1]  
Christofides N., 1975, GRAPH THEORY ALGORIT
[2]  
Chvatal V, 1973, LECT NOTES MATH, V406, P243
[3]  
Erdos P., 1959, CANADIAN J MATH, V11, P34
[4]  
Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364
[5]  
Mycielski J, 1955, C MATH, V3, P161