Generalized Ramsey Numbers for Graphs with Three Disjoint Cycles Versus a Complete Graph.
Shinya FujitaPublished in: Electron. J. Comb. (2012)
Keyphrases
- graph representation
- directed graph
- graph matching
- graph theory
- graph structure
- graph theoretic
- weighted graph
- graph databases
- labeled graphs
- graph construction
- graph mining
- graph structures
- adjacency matrix
- graph clustering
- graph properties
- graph classification
- graph model
- graph transformation
- graph representations
- undirected graph
- graph search
- directed acyclic
- graph theoretical
- random graphs
- series parallel
- graph data
- graph partitioning
- spanning tree
- bipartite graph
- subgraph isomorphism
- minimum spanning tree
- graph isomorphism
- graph patterns
- dynamic graph
- reachability queries
- graph drawing
- connected graphs
- maximum common subgraph
- connected dominating set
- connected components
- graph kernels
- maximum cardinality
- bounded treewidth
- structured data
- structural pattern recognition
- dense subgraphs
- disk resident
- attributed graphs
- evolving graphs
- spectral decomposition
- web graph
- maximum clique
- query graph
- edge weights
- pairwise
- maximum independent set
- inexact graph matching
- random walk
- finding the shortest path
- planar graphs
- graph layout
- bounded degree
- real world graphs
- social graphs
- fully connected
- maximal cliques
- degree distribution
- relational structures
- directed acyclic graph
- attributed relational graph
- np complete