The (theta, wheel)-free graphs Part III: cliques, stable sets and coloring
A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this...
|Place of publication:||
|Data of publication:||2017-07-13|
Database information Databases - DBIS