The strong perfect graph conjecture for toroifal graphs.
Charles M. GrinsteadPublished in: J. Comb. Theory, Ser. B (1981)
Keyphrases
- graph representation
- graph matching
- graph theory
- graph structure
- weighted graph
- labeled graphs
- graph databases
- directed graph
- graph theoretic
- graph construction
- graph model
- graph classification
- graph structures
- adjacency matrix
- graph mining
- graph search
- graph data
- graph theoretical
- bipartite graph
- undirected graph
- subgraph isomorphism
- graph clustering
- graph isomorphism
- graph partitioning
- series parallel
- graph kernels
- graph properties
- graph edit distance
- graph representations
- spanning tree
- reachability queries
- evolving graphs
- structural pattern recognition
- graph transformation
- minimum spanning tree
- connected graphs
- dense subgraphs
- dynamic graph
- finding the shortest path
- random graphs
- edge weights
- random walk
- graph drawing
- graph patterns
- maximal cliques
- inexact graph matching
- graph layout
- massive graphs
- connected dominating set
- maximum common subgraph
- disk resident
- structured data
- maximum clique
- directed acyclic
- connected components
- web graph
- maximum cardinality
- topological information
- adjacency graph
- spectral decomposition
- query graph
- real world graphs
- social graphs
- polynomial time complexity
- proximity graph
- association graph
- densely connected
- relational graph
- bounded treewidth
- frequent subgraphs
- fully connected
- complex networks