Images of rigid digraphs

DOI10.1016/S0195-6698(13)80005-4zbMath0715.05027OpenAlexW2027798648MaRDI QIDQ751667

Jaroslav Nešetřil, Pavol Hell

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80005-4

zbMATH Keywords

homomorphismrigid digraphswell-quasi-ordered sets

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

The endomorphism spectrum of an ordered set ⋮ Complexity of tree homomorphisms ⋮ Path homomorphisms ⋮ Duality pairs and homomorphisms to oriented and unoriented cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quotients of rigid graphs
• Better quasi-orders for uncountable cardinals
• Homomorphisms of graphs and of their orientations
• Symmetric relations (undirected graphs) with given semigroups
• On symmetric and antisymmetric relations
• On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
• Graphs and k-Societies
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Images of rigid digraphs