An universality argument for graph homomorphisms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3650785 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- Finite paths are universal
- Graph minors. XX: Wagner's conjecture
- Labeled posets are universal
- Mathematical Foundations of Computer Science 2005
- Some examples of universal and generic partial orders
- The Homomorphism Structure of Classes of Graphs
- Universal partial order represented by means of oriented trees and other simple graphs
- Universality of intervals of line graph order
Cited in
(9)- Polyadic sets and homomorphism counting
- scientific article; zbMATH DE number 1420847 (Why is no real title available?)
- Labeled posets are universal
- Fractal property of the graph homomorphism order
- Universal partial order represented by means of oriented trees and other simple graphs
- Finite paths are universal
- Graph-Theoretic Concepts in Computer Science
- Universality of intervals of line graph order
- On the homomorphism order of labeled posets
This page was built for publication: An universality argument for graph homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322345)
