Double-critical graph conjecture for claw-free graphs.
Martin RolekZi-Xia SongPublished in: Discret. Math. (2017)
Keyphrases
- graph representation
- graph structure
- graph matching
- graph theory
- labeled graphs
- directed graph
- graph theoretic
- graph databases
- weighted graph
- graph mining
- graph construction
- graph search
- graph properties
- graph theoretical
- graph classification
- adjacency matrix
- random graphs
- graph model
- graph structures
- graph partitioning
- bipartite graph
- graph data
- graph clustering
- series parallel
- subgraph isomorphism
- dense subgraphs
- graph kernels
- undirected graph
- graph isomorphism
- spanning tree
- maximum clique
- structural pattern recognition
- connected dominating set
- community discovery
- minimum spanning tree
- evolving graphs
- connected graphs
- finding the shortest path
- maximum cardinality
- graph layout
- graph edit distance
- dynamic graph
- graph drawing
- directed acyclic
- graph transformation
- maximum independent set
- average degree
- disk resident
- reachability queries
- spectral decomposition
- neighborhood graph
- massive graphs
- social graphs
- planar graphs
- association graph
- graph representations
- edge weights
- independent set
- adjacency graph
- query graph
- structured data
- connected components
- attributed graphs
- graph embedding
- random walk
- real world graphs
- link analysis
- web graph
- fully connected
- quasi cliques
- maximal cliques
- bounded treewidth
- social networks
- topological information
- proximity graph
- strongly connected
- degree distribution
- polynomial time complexity
- vertex set