Equimatchable Graphs are C_2k+1-free for k ≥ 4.
Cemil DibekTínaz EkimDidem GözüpekMordechai ShalomPublished in: CTW (2015)
Keyphrases
- graph matching
- graph theory
- database
- neural network
- artificial intelligence
- information systems
- graph theoretic
- graph partitioning
- bipartite graph
- graph structure
- graph databases
- adjacency graph
- structured objects
- graph theoretical
- graph representation
- graph model
- directed graph
- random walk
- xml documents
- information retrieval
- real world
- databases