Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice.
David Flores-PeñalozaFrancisco Javier Zaragoza MartínezPublished in: CCCG (2009)
Keyphrases
- graph mining
- subgraph isomorphism
- graph classification
- connected components
- random walk
- graph representation
- graph data
- edge weights
- graph structure
- graph theory
- graph databases
- weighted graph
- directed acyclic graph
- graph theoretic
- bipartite graph
- graph construction
- structured data
- labeled graphs
- stable set
- maximum matching
- np hard
- directed graph
- graph properties
- frequent subgraph mining