Core-like properties of infinite graphs and structures

DOI10.1016/0012-365X(94)00191-KzbMath0821.05053MaRDI QIDQ1842150

Bruce L. Bauslaugh

Publication date: 12 September 1995

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

zbMATH Keywords

digraphhomomorphismendomorphisminfinite graphsstructureretractionshomomorphic equivalencestrongly invariantcore-like properties of a structure

Mathematics Subject Classification ID

Graph theory (05C99) Relational systems, laws of composition (08A02) Automorphisms and endomorphisms of algebraic structures (08A35)

Related Items

The quest for a characterization of hom-properties of finite character ⋮ Compactness and finite equivalence of infinite digraphs ⋮ Preserving Constraints with the Stable Chase ⋮ Temporal Minimal-World Query Answering over Sparse ABoxes ⋮ Homomorphisms and amalgamation ⋮ Constants and finite unary relations in qualitative constraint reasoning ⋮ Unnamed Item ⋮ Towards a Ryll-Nardzewski-type theorem for weakly oligomorphic structures ⋮ Core-like properties of infinite graphs and structures

Cites Work

• Unnamed Item
• On minimal graphs
• Color-families are dense
• Core-like properties of infinite graphs and structures
• Unretractive and S-unretractive joins and lexicographic products of graphs
• The Complexity of Colouring by Semicomplete Digraphs
• Fixed-edge theorem for graphs with loops