Path homomorphisms

DOI10.1017/S0305004100074806zbMath0857.05057WikidataQ105856491 ScholiaQ105856491MaRDI QIDQ4892428

Xuding Zhu, Jaroslav Nešetřil

Publication date: 6 March 1997

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

paths; homomorphism; trees; countable poset

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

05C38: Paths and cycles

05C99: Graph theory

Related Items

Finite paths are universal, Finite paths are universal, Universality of intervals of line graph order, Finite presentation of homogeneous graphs, posets and Ramsey classes, Minimal universal and dense minor closed classes, A surprising permanence of old motivations (a not-so-rigid story), Fractional multiples of graphs and the density of vertex-transitive graphs, Universal partial order represented by means of oriented trees and other simple graphs, Duality theorems for finite structures (characterising gaps and good characterisations), Generalised dualities and maximal finite antichains in the homomorphism order of relational structures, Circular colouring and graph homomorphism

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