On the homomorphism order of labeled posets
From MaRDI portal
Publication:634750
DOI10.1007/s11083-010-9169-xzbMath1231.06001arXiv0911.0200WikidataQ56389103 ScholiaQ56389103MaRDI QIDQ634750
Erkko Lehtonen, Léonard Kwuida
Publication date: 16 August 2011
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.0200
homomorphism; partial order; complexity of decision problems; labeled poset; representation of directed graphs by \(k\)-posets
06A06: Partial orders, general
06D05: Structure and representation theory of distributive lattices
05C20: Directed graphs (digraphs), tournaments
Related Items
The homomorphism lattice induced by a finite algebra, Universality of intervals of line graph order, Homomorphic image orders on combinatorial structures., Complexity Issues for Preorders on Finite Labeled Forests
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
