Full duality among graph algebras and flat graph algebras
From MaRDI portal
Publication:5950759
zbMath0980.08006MaRDI QIDQ5950759
Ross Willard, George F. McNulty, William A. Lampe
Publication date: 16 December 2001
Published in: Algebra Universalis (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Quasivarieties (08C15) Sets with a single binary operation (groupoids) (20N02)
Related Items (6)
Finite affine algebras are fully dualizable ⋮ Flat unars: the primal, the semi-primal and the dualisable ⋮ Dualisability versus residual character: a theorem and a counterexample ⋮ The computational complexity of deciding whether a finite algebra generates a minimal variety ⋮ Dualizability of automatic algebras. ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
This page was built for publication: Full duality among graph algebras and flat graph algebras
