Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops

DOI10.1007/S00373-014-1435-ZzbMath1327.05139OpenAlexW2032543488MaRDI QIDQ497356

Dragan Mašulović

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1435-z

zbMATH Keywords

oriented graphshomomorphism-homogeneous structures

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

The classification of homomorphism homogeneous tournaments

Cites Work

• On finite reflexive homomorphism-homogeneous binary relational systems
• Remarks on homomorphism-homogeneous lattices and semilattices
• Some classes of finite homomorphism-homogeneous point-line geometries
• Homomorphism-homogeneous partially ordered sets
• Homomorphism-homogeneous \(L\)-colored graphs
• Homomorphism-homogeneous graphs
• Oligomorphic transformation monoids and homomorphism-homogeneous structures
• Finite irreflexive homomorphism-homogeneous binary relational systems
• A universality result for endomorphism monoids of some ultrahomogeneous structures
• Homomorphism-Homogeneous Relational Structures
• Finite homomorphism-homogeneous tournaments with loops
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• ON THE COMPLEXITY OF DECIDING HOMOMORPHISM-HOMOGENEITY FOR FINITE ALGEBRAS
• On the largest tree of given maximum degree in a connected graph
• Homomorphism-homogeneous monounary algebras

This page was built for publication: Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops