using hajos construction to generate hard graph 3-colorability     instances

	using hajos construction to generate hard graph 3-colorability instances
	Liu Sheng; Zhang Jian
	2006
会议名称	8th International Conference on Artificial Intelligence and Symbolic Computation
页码	211-225
会议日期	SEP 20-22,
会议地点	Beijing, PEOPLES R CHINA
收录类别	SCI
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS
ISSN	0302-9743
ISBN	3-540-39728-0
部门归属	Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China. Grad Univ, Chinese Acad Sci, Beijing 100049, Peoples R China.
摘要	In this paper we propose a constructive algorithm using constraint propagation to generate 4-critical graph units (4-CGUs) which have only one triangle as subgraph. Based on these units we construct 4-critical graphs using Hajos join construct
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12126
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Liu Sheng,Zhang Jian. using hajos construction to generate hard graph 3-colorability instances[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS,2006:211-225.