| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5776778 | Discrete Mathematics | 2017 | 9 Pages |
Abstract
Most of the results here are upper bounds for the CCHI, as functions of some other graph parameters, and contrasting with lower bounds in some cases. Algorithmic aspects are also discussed; the main result within this scope (and in the paper) shows that testing whether the CCHI of a graph equals 2 is NP-complete. We deal with the CCHN of the graph itself as well.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gábor Bacsó, ZdenÄk RyjáÄek, Zsolt Tuza,