Graphs without short odd cycles are nearly bipartite.
Ervin GyöriAlexandr V. KostochkaTomasz LuczakPublished in: Discret. Math. (1997)
Keyphrases
- bipartite graph
- graph model
- graph partitioning
- undirected graph
- graph representation
- graph matching
- graph theory
- pattern recognition
- real valued
- graph theoretic
- weighted graph
- directed graph
- graph theoretical
- graph structure
- series parallel
- labeled graphs
- bipartite networks
- real time
- spanning tree
- graph databases
- link prediction
- search algorithm
- information systems
- search engine
- neural network
- data sets