Maximal partial clones determined by the areflexive relations

DOI10.1016/0166-218X(92)90279-JzbMath0695.08010MaRDI QIDQ909690

Lucien Haddad, Ivo G. Rosenberg

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphdirected graphprimalitycomplete clonesmaximal partial clones

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Operations and polynomials in algebraic structures, primal algebras (08A40) Partial algebras (08A55)

Related Items

Partial clones containing all permutations ⋮ Uniqueness of minimal coverings of maximal partial clones ⋮ Completeness theory for finite partial algebras

Cites Work

• The strong chromatic number of partial triple systems
• Maximal subalgebras of algebras of partial multivalued logic functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal partial clones determined by the areflexive relations