HOPS web view
This page lists:
Parameters
Simplified hierarchy
- Hasse hierarchy PDF
- Simplified Hasse hierarchy PDF
- Comparison table PDF
- Simplified comparison table PDF
All parameters in HOPS
Graph classes
Some parameters are derived from associated graph classes. Graph classes can be also used as witnesses of proper inclusions. For these purposes, we use the following graph class hierarchy. We assume that all of the graph class inclusions are proper.
We aim to have here only the graph classes that influence parameter inclusions. Please, see Information System on Graph Classes and their Inclusions (ISGCI) for an exhaustive list of graph classes and their inclusions.
Graph class ⮁ | Relevance ⮁ |
---|---|
bipartite | ████████░ |
block | ████░░░░░ |
chordal | █████░░░░ |
cluster | ██████░░░ |
co-cluster | ██████░░░ |
cograph | ███████░░ |
complete | █████████ |
connected | ██░░░░░░░ |
cycle | ██░░░░░░░ |
cycles | ████░░░░░ |
disjoint cycles | ████░░░░░ |
edgeless | █░░░░░░░░ |
forest | █████████ |
grid | ██████░░░ |
interval | ███████░░ |
linear forest | ████░░░░░ |
outerplanar | █████░░░░ |
path | ███░░░░░░ |
perfect | ██████░░░ |
planar | ████████░ |
star | ███░░░░░░ |
stars | ████░░░░░ |
tree | ███████░░ |