Connectivity notions on compatible digraphs in equational classes

Gergő Gyenizse, Miklós Maróti, László Zádori

A digraph $\mathbb{G}$ is called weakly connected, strongly connected, and extremely connected if any two vertices of $\mathbb{G}$ are connected respectively by an oriented, a direct…