Path homomorphisms
From MaRDI portal
Publication:4892428
DOI10.1017/S0305004100074806zbMath0857.05057OpenAlexW4248096217WikidataQ105856491 ScholiaQ105856491MaRDI QIDQ4892428
Publication date: 6 March 1997
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0305004100074806
Related Items (11)
Minimal universal and dense minor closed classes ⋮ Generalised dualities and maximal finite antichains in the homomorphism order of relational structures ⋮ Universal partial order represented by means of oriented trees and other simple graphs ⋮ Universality of intervals of line graph order ⋮ Finite paths are universal ⋮ Finite paths are universal ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Fractional multiples of graphs and the density of vertex-transitive graphs ⋮ Duality theorems for finite structures (characterising gaps and good characterisations) ⋮ Circular colouring and graph homomorphism ⋮ Finite presentation of homogeneous graphs, posets and Ramsey classes
Cites Work
- Unnamed Item
- The core of a graph
- Images of rigid digraphs
- Symmetric graphs and interpretations
- The effect of two cycles on the complexity of colourings by directed graphs
- On the complexity of H-coloring
- On multiplicative graphs and the product conjecture
- Polynomial graph-colorings
- Universality of \(A\)-mote graphs
- Homomorphisms of graphs and of their orientations
- On classes of relations and graphs determined by subobjects and factorobjects
- Homomorphisms to oriented cycles
- Mutiplicativity of oriented cycles
- Homomorphisms to oriented paths
- On unavoidable digraphs in orientations of graphs
- The Complexity of Colouring by Semicomplete Digraphs
- On the complexity of the general coloring problem
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Path homomorphisms
