There are four countable ultrahomogeneous graphs without triangles.
Robert E. WoodrowPublished in: J. Comb. Theory, Ser. B (1979)
Keyphrases
- massive graphs
- graph matching
- markov chain
- directed graph
- graph theoretic
- pairwise
- bipartite graph
- graph isomorphism
- neural network
- graph partitioning
- graph clustering
- undirected graph
- reachability queries
- labeled graphs
- structured objects
- graph construction
- graph representation
- weighted graph
- graph theory
- pattern recognition
- learning algorithm