Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-27T23:08:15.819Z Has data issue: false hasContentIssue false
  • English
  • Français

A Canonical Factorization for Graph Homomorphisms

Published online by Cambridge University Press:  20 November 2018

Barry Fawcett
Barry Fawcett*
Affiliation:
Laurentian University, Sudbury, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The graphs are undirected, without loops or multiple edges. The edge set E(X) of a graph X is a set of certain unordered pairs [x, y] of distinct elements of the vertex set V(X). For x ϵ V(X) we denote by E(x; X) the edges of X incident with x. A (homo)morphism ϕ : X ⟶ Y is a function from V(X) to V(Y) which preserves edges; thus it induces ϕ# : E(X) ⟶ E(Y) by ϕ# [x, x’] = [ϕx, ϕx’].

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 29 , Issue 4 , 01 August 1977 , pp. 738 - 743
Copyright
Copyright © Canadian Mathematical Society 1977

References

1. Fawcett, B., A categorical characterization of the four colour theorem, submitted.Google Scholar
2. Hell, P., Retracts of graphs, Thesis, U. de Montréal, 1971.Google Scholar
3. Schubert, H., Categories (Academic Press, Berlin, 1972).Google Scholar