In the present article, we continue to study the complexity of the lattice of quasivarieties of graphs. For every quasivariety K of graphs that contains a non-bipartite graph, we find a subquasivariety K′ ⊆ K such that there exist 2^ω subquasivarieties K″ ∈ L_q(K′) without covers (hence, without independent bases for their quasi-identities in K′).

中文翻译：

---

图的拟变和独立公理化

在本文中，我们将继续研究图拟相似性的格的复杂性。对于每一个quasivariety ķ图的包含非二分图，我们发现了一个subquasivariety ķ '⊆ ķ使得存在2个^ω subquasivarieties ķ “∈大号_q（ķ '）没有盖子（因此，没有为它们准独立基地K '中的恒等式。