High-girth cubic graphs are homomorphic to the Clebsch graph.
Matt DeVosRobert SámalPublished in: J. Graph Theory (2011)
Keyphrases
- graph theory
- graph representation
- graph matching
- directed graph
- graph structure
- weighted graph
- graph databases
- graph mining
- graph construction
- graph model
- adjacency matrix
- labeled graphs
- graph structures
- graph theoretic
- graph classification
- subgraph isomorphism
- graph clustering
- graph partitioning
- graph theoretical
- graph properties
- graph data
- spanning tree
- bipartite graph
- inexact graph matching
- series parallel
- graph search
- structural pattern recognition
- random graphs
- graph drawing
- maximum common subgraph
- directed acyclic
- undirected graph
- graph isomorphism
- graph transformation
- disk resident
- adjacency graph
- connected dominating set
- privacy preserving
- attributed graphs
- web graph
- graph embedding
- graph kernels
- data exchange
- connected components
- attributed relational graph
- connected graphs
- evolving graphs
- edge weights
- dense subgraphs
- reachability queries
- graph patterns
- neighborhood graph
- query graph
- planar graphs
- graph layout
- power law
- small world
- massive graphs
- bounded treewidth
- maximum independent set
- degree distribution