Recognizing decomposable graphs
作者:
V. Chvátal,
期刊:
Journal of Graph Theory
(WILEY Available online 1984)
卷期:
Volume 8,
issue 1
页码: 51-53
ISSN:0364-9024
年代: 1984
DOI:10.1002/jgt.3190080106
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractA graph is called decomposable if its vertices can be colored red and blue in such a way that each color appears on at least one vertex but each vertex v has at most one neighbor having a different color from v. We point out a simple and efficient algorithm for recognizing decomposable graphs with maximum degree at most 3 and prove that recognizing decomposable graphs with maximum degree 4 is an NP‐complete proble
点击下载:
PDF
(128KB)
返 回