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)
05C75: Structural characterization of families of graphs
08C15: Quasivarieties
20N02: Sets with a single binary operation (groupoids)
Related Items
Finite affine algebras are fully dualizable, The computational complexity of deciding whether a finite algebra generates a minimal variety, A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots)., Flat unars: the primal, the semi-primal and the dualisable, Dualisability versus residual character: a theorem and a counterexample, Dualizability of automatic algebras.