Every 3-colorable graph has a faithful representation in the odd-distance graph.
Tien-Nam LeFiachra KnoxMoshe RosenfeldPublished in: Discret. Math. (2015)
Keyphrases
- graph representation
- graph theory
- graph theoretic
- random walk
- graph structure
- structured data
- graph matching
- bipartite graph
- graph model
- graph based algorithm
- random graphs
- graphical representation
- undirected graph
- spanning tree
- link analysis
- weighted graph
- directed graph
- distance measure
- graph databases
- graph construction
- neighborhood graph
- graph search
- neural network