Families of graphs complete for the strong perfect graph Conjecture.
Derek G. CorneilPublished in: J. Graph Theory (1986)
Keyphrases
- graph representation
- graph structure
- graph theory
- graph matching
- directed graph
- graph theoretic
- weighted graph
- graph construction
- labeled graphs
- graph databases
- graph model
- adjacency matrix
- graph structures
- graph theoretical
- series parallel
- graph search
- graph properties
- bipartite graph
- graph clustering
- subgraph isomorphism
- random graphs
- graph classification
- graph mining
- graph kernels
- graph partitioning
- undirected graph
- dynamic graph
- disk resident
- spanning tree
- reachability queries
- graph transformation
- graph representations
- graph edit distance
- structural pattern recognition
- connected graphs
- maximum common subgraph
- evolving graphs
- graph isomorphism
- graph data
- finding the shortest path
- massive graphs
- graph drawing
- dense subgraphs
- inexact graph matching
- minimum spanning tree
- random walk
- maximal cliques
- graph embedding
- web graph
- maximum clique
- directed acyclic
- spectral decomposition
- neighborhood graph
- polynomial time complexity
- average degree
- planar graphs
- degree distribution
- edge weights
- hyper graph
- maximum independent set
- adjacency graph