On finite reflexive homomorphism-homogeneous binary relational systems

DOI10.1016/J.DISC.2011.07.032zbMath1250.08001arXiv0912.4978OpenAlexW2043054749MaRDI QIDQ409366

Dragan Mašulović, Nemanja Škorić, Rajko Nenadov

Publication date: 13 April 2012

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

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

zbMATH Keywords

coNP-completenessfinite digraphshomomorphism-homogeneous relational structures

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Relational systems, laws of composition (08A02) Automorphisms and endomorphisms of algebraic structures (08A35)

Related Items (5)

Connected-Homomorphism-Homogeneous Graphs ⋮ Unnamed Item ⋮ Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops ⋮ ON THE COMPLEXITY OF DECIDING HOMOMORPHISM-HOMOGENEITY FOR FINITE ALGEBRAS ⋮ On polymorphism-homogeneous relational structures and their clones.

Cites Work

• Posets, homomorphisms and homogeneity
• Homomorphism-homogeneous partially ordered sets
• Homomorphism-homogeneous graphs
• Finite irreflexive homomorphism-homogeneous binary relational systems
• Homomorphism-Homogeneous Relational Structures
• Finite homomorphism-homogeneous tournaments with loops
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• On Subtournaments of a Tournament

This page was built for publication: On finite reflexive homomorphism-homogeneous binary relational systems