Recognizing Global Occurrence of Local Properties


Let P be a graph property. For k ≥ 1, a graph G has property Pk iff every induced k-vertex subgraph of G has P. For a graph G we denote by NPk(G) the number of induced k-vertex subgraphs of G having P. A property is called spanning if it does not hold for graphs that contain isolated vertices. A property is called connected if it does not hold for graphs… (More)
DOI: 10.1006/jcom.1997.0450