On the complexity of testing for odd holes and induced odd paths
暂无分享,去创建一个
Abstract The following problems, of possible interest with regards to perfect graphs, are shown to be NP-Complete. 1. (1) Does a graph contain an induced odd cycle of length greater than three, passing through a prescribed vertex? 2. (2) Does a graph contain an induced odd path between two prescribed vertices? 3. (3) Does a graph contain an induced odd path between every two vertices?
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Henry Meyniel,et al. A New Property of Critical Imperfect Graphs and some Consequences , 1987, Eur. J. Comb..
[3] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .