Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer.
Hemanshu KaulAlexandr V. KostochkaPublished in: Comb. Probab. Comput. (2007)
Keyphrases
- graph theory
- graph theoretical
- graph theoretic
- graph representation
- graph matching
- graph structure
- weighted graph
- graph construction
- graph properties
- maximum independent set
- adjacency matrix
- directed graph
- graph databases
- minimum spanning tree
- graph mining
- graph partitioning
- labeled graphs
- graph classification
- complex networks
- graph search
- structural pattern recognition
- graph clustering
- graph structures
- bipartite graph
- graph data
- random graphs
- graph kernels
- graph representations
- graph model
- graph transformation
- undirected graph
- series parallel
- graph drawing
- subgraph isomorphism
- finding the shortest path
- dynamic graph
- spanning tree
- maximal cliques
- maximum clique
- disk resident
- shortest path
- connected dominating set
- planar graphs
- graph patterns
- association graph
- social network analysis
- connected graphs
- community detection
- directed acyclic
- reachability queries
- average degree
- vertex set
- graph embedding
- community discovery
- proximity graph
- dense subgraphs
- edge weights
- strongly connected components
- evolving graphs
- graph isomorphism
- real world graphs
- connected components
- attributed relational graph
- maximum common subgraph