Subdivision of the hierarchy of H-colorable graph classes by circulant graphs.
Akihiro UejimaHiro ItoPublished in: Electron. Notes Discret. Math. (2004)
Keyphrases
- graph representation
- graph theory
- graph structure
- weighted graph
- adjacency matrix
- graph matching
- graph theoretic
- graph databases
- graph construction
- labeled graphs
- graph mining
- directed graph
- graph structures
- graph theoretical
- graph clustering
- class hierarchy
- graph isomorphism
- series parallel
- graph search
- subgraph isomorphism
- graph partitioning
- graph model
- directed acyclic
- bounded degree
- bipartite graph
- graph properties
- random graphs
- graph classification
- graph data
- graph representations
- disk resident
- spanning tree
- graph kernels
- edge weights
- undirected graph
- structured data
- graph patterns
- reachability queries
- graph drawing
- maximum cardinality
- least squares
- pattern mining
- connected dominating set
- finding the shortest path
- community discovery
- structural pattern recognition
- equivalence classes
- dynamic graph
- adjacency graph
- graph transformation
- web graph
- inexact graph matching
- graph layout
- bounded treewidth
- minimum spanning tree
- query graph
- neighborhood graph
- association graph
- planar graphs
- attributed graphs
- evolving graphs
- social networks
- social graphs
- connected components
- small world
- densely connected
- np complete
- massive graphs
- shortest path
- maximal cliques
- maximum common subgraph