Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture.
Mark A. BuckinghamMartin Charles GolumbicPublished in: Discret. Math. (1983)
Keyphrases
- graph theory
- graph representation
- directed graph
- graph matching
- graph structure
- graph model
- graph databases
- weighted graph
- graph mining
- graph clustering
- series parallel
- bipartite graph
- graph structures
- graph classification
- graph theoretic
- labeled graphs
- graph isomorphism
- undirected graph
- graph search
- random graphs
- graph theoretical
- graph data
- structural pattern recognition
- spanning tree
- subgraph isomorphism
- maximum common subgraph
- graph representations
- adjacency matrix
- graph partitioning
- graph transformation
- graph construction
- attributed graphs
- planar graphs
- connected graphs
- minimum spanning tree
- graph properties
- maximal cliques
- finding the shortest path
- frequent subgraphs
- independent set
- maximum clique
- query graph
- graph patterns
- social graphs
- average degree
- disk resident
- spectral decomposition
- reachability queries
- edge weights
- directed acyclic
- evolving graphs
- fully connected
- neighborhood graph
- strongly connected