A SHORT PROOF OF A THEOREM OF DIRACS ABOUT HADWIGERS CONJECTURE

被引：10
|
作者：
WOODALL, DR
机构：
[1] Department of Mathematics, University of Nottingham, Nottingham
来源：
JOURNAL OF GRAPH THEORY | 1992年 / 16卷 / 01期
关键词：
D O I：
10.1002/jgt.3190160109
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A short proof is given of the theorem that every graph that does not have K4 as a subcontraction is properly vertex 3-colorable.
引用
收藏
页码：79 / 80
页数：2
相关论文
共 50 条
12345