3 problems

Small Implicit Graph Conjecture for hereditary graph classes
Small Implicit Graph Conjecture. Every hereditary small graph class admits an implicit representation.
openFrom papersgraph-labeling hereditary-graphs implicit-representations
0 responses
3
Characterisation of minimal hereditary graph classes of unbounded clique-width
Characterisation conjecture. The hereditary graph class $\mathcal{G}^\delta$ is minimal of unbounded clique-width if and only if $\delta \in \Delta_{\min}$ .
openFrom papersclique-width graph-classes hereditary-graphs
0 responses
3
Lozin–Razgon–Zamaraev's finite-definition conjecture for induced-subgraph well-quasi-ordering
Lozin–Razgon–Zamaraev's labelled induced-subgraph conjecture. If $\mathcal{G}$ is defined by a finite set of forbidden induced subgraphs, then $\mathcal{G}$ is well-quasi-ordered b…
openFrom papershereditary-graphs well-quasi-orders
0 responses
6

Small Implicit Graph Conjecture for hereditary graph classes