On the strong perfect graph conjecture and critical graphs.
M. R. SridharanO. T. GeorgePublished in: Discret. Math. (1982)
Keyphrases
- graph representation
- graph theory
- labeled graphs
- graph structure
- graph theoretic
- graph matching
- weighted graph
- directed graph
- graph databases
- graph classification
- graph properties
- graph structures
- graph clustering
- graph mining
- graph construction
- graph theoretical
- adjacency matrix
- subgraph isomorphism
- random graphs
- graph partitioning
- graph model
- series parallel
- graph isomorphism
- graph search
- bipartite graph
- graph kernels
- undirected graph
- spanning tree
- inexact graph matching
- graph transformation
- dynamic graph
- structural pattern recognition
- minimum spanning tree
- graph edit distance
- graph data
- maximum clique
- reachability queries
- dense subgraphs
- graph representations
- connected dominating set
- maximum common subgraph
- maximum cardinality
- directed acyclic
- disk resident
- average degree
- connected graphs
- web graph
- social graphs
- evolving graphs
- query graph
- massive graphs
- neighborhood graph
- association graph
- degree distribution
- attributed graphs
- graph layout
- topological information
- proximity graph
- adjacency graph
- low degree
- planar graphs
- graph patterns
- graph drawing
- random walk
- graph embedding
- connected components