Almost All Graphs with 1.44n Edges are 3-Colorable.
Vasek ChvátalPublished in: Random Struct. Algorithms (1991)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- real world graphs
- edge weights
- graph structure
- spectral embedding
- graph matching
- graph theory
- edge information
- directed edges
- massive graphs
- structured objects
- graph representation
- directed acyclic graph
- graph model
- bipartite graph
- graph theoretic
- connected components
- graph clustering
- graph construction
- graph structures
- random walk
- np complete
- object recognition
- densely connected
- multiscale
- straight edges
- genetic algorithm