Graph homomorphisms: structure and symmetry

1997/01/01 by Geňa Hahn, Claude Tardif · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Comparability graph #Computational Geometry and Mesh Generation #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Graph homomorphism #Homomorphism #Line graph #Mathematics #Symmetric graph #Transitive relation #Vertex (graph theory) #Vertex-transitive graph #Voltage graph

paper · doi:10.1007/978-94-015-8937-6_4

crossref issued 1997/01/01 · crossref published 1997/01/01 · crossref published-print 1997/01/01 · openalex publication_date 1997/01/01 · crossref created 2013/02/03 · crossref deposited 2020/07/21 · openalex created_date 2025/10/10 · crossref indexed 2026/03/19 · openalex updated_date 2026/08/04

Citations

• A Dynamic location problem for graphs
• A Colour Problem for Infinite Graphs and a Problem in the Theory of Relations
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Vertex-to-vertex pursuit in a graph
• Absolute retracts of bipartite graphs
• The core of a graph
• On the complexity of H-coloring
• Color-families are dense
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Graph Theory and Probability

Cited by

• A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations
• Graph homomorphism [wikipedia]