Homomorphisms from sparse graphs to the Petersen graph.
Min ChenAndré RaspaudPublished in: Discret. Math. (2010)
Keyphrases
- graph theory
- directed acyclic
- graph representation
- graph structure
- graph theoretical
- gaussian graphical models
- graph matching
- weighted graph
- graph theoretic
- directed graph
- labeled graphs
- graph properties
- graph construction
- graph clustering
- graph databases
- adjacency matrix
- graph mining
- graph model
- graph classification
- graph representations
- graph search
- graph structures
- series parallel
- bipartite graph
- densely connected
- disk resident
- graph transformation
- random graphs
- undirected graph
- reachability queries
- spanning tree
- dynamic graph
- maximum clique
- inexact graph matching
- graph drawing
- graph isomorphism
- graphical models
- structural pattern recognition
- connected dominating set
- graph partitioning
- subgraph isomorphism
- complex networks
- graph data
- minimum spanning tree
- social network analysis
- graph layout
- maximum common subgraph
- neighborhood graph
- dense subgraphs
- adjacency graph
- graph patterns
- random walk
- graph embedding
- attributed relational graph
- attributed graphs
- maximum cardinality
- finding the shortest path
- connected graphs
- sparse representation
- directed acyclic graph
- edge weights
- graph kernels
- maximal cliques
- planar graphs
- high dimensional
- connected components
- query graph
- laplacian matrix
- vertex set
- strongly connected