Regular graphs with prescribed chromatic number
作者:
L. Caccetta,
N. J. Pullman,
期刊:
Journal of Graph Theory
(WILEY Available online 1990)
卷期:
Volume 14,
issue 1
页码: 65-71
ISSN:0364-9024
年代: 1990
DOI:10.1002/jgt.3190140107
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractWe determine the minimum number of edges in a regular connected graph onnvertices, containing a complete subgraph of orderk≤n/2. This enables us to confirm and strengthen a conjecture of P. Erdös on the existence of regular graphs with prescribed chromatic numb
点击下载:
PDF
(200KB)
返 回