On the homomorphism order of labeled posets

DOI10.1007/s11083-010-9169-xzbMath1231.06001arXiv0911.0200OpenAlexW2131577292WikidataQ56389103 ScholiaQ56389103MaRDI QIDQ634750

Léonard Kwuida, Erkko Lehtonen

Publication date: 16 August 2011

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.0200

zbMATH Keywords

homomorphismpartial ordercomplexity of decision problemslabeled posetrepresentation of directed graphs by \(k\)-posets

Mathematics Subject Classification ID

Partial orders, general (06A06) Structure and representation theory of distributive lattices (06D05) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

The homomorphism lattice induced by a finite algebra ⋮ Homomorphism order of connected monounary algebras ⋮ Universality of intervals of line graph order ⋮ Complexity Issues for Preorders on Finite Labeled Forests ⋮ Homomorphic image orders on combinatorial structures.

Cites Work

• Free shuffle algebras in language varieties
• The core of a graph
• Descending chains and antichains of the unary, linear, and monotone subfunction relations
• Modeling concurrency with partial orders
• On the complexity of H-coloring
• The equational theory of pomsets
• NP-partitions over posets with an application to reducing the set of solutions of NP problems
• Universal partial order represented by means of oriented trees and other simple graphs
• Lattices and ordered algebraic structures
• Algebra and theory of order-deterministic pomsets
• Labeled posets are universal
• Theories of orders on the set of words
• Logical Approaches to Computational Barriers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the homomorphism order of labeled posets