Homomorphism-homogeneous \(L\)-colored graphs

DOI10.1016/j.ejc.2013.06.038zbMath1292.05110arXiv1204.5879OpenAlexW2076891386MaRDI QIDQ2509759

Dragan Mašulović, Jan Hubička, David Hartman

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Unnamed Item ⋮ Permutation monoids and MB-homogeneity for graphs and relational structures ⋮ The classification of homomorphism homogeneous tournaments ⋮ Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops ⋮ The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Posets, homomorphisms and homogeneity
• Countable homogeneous partially ordered sets
• Homogeneous graphs
• Homomorphism-homogeneous partially ordered sets
• Homomorphism-homogeneous graphs
• Homomorphism-Homogeneous Relational Structures
• Finite homomorphism-homogeneous tournaments with loops
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments

This page was built for publication: Homomorphism-homogeneous \(L\)-colored graphs