New Graph Calculi for Planar Non-3-Colorable Graphs.
Youichi HanataniTakashi HoriyamaKazuo IwamaSuguru TamakiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2008)
Keyphrases
- planar graphs
- graph representation
- graph matching
- graph theory
- graph databases
- graph structure
- directed graph
- graph construction
- weighted graph
- labeled graphs
- graph structures
- graph classification
- graph theoretic
- adjacency matrix
- graph theoretical
- series parallel
- graph mining
- graph model
- graph isomorphism
- graph clustering
- graph search
- graph partitioning
- graph properties
- undirected graph
- random graphs
- subgraph isomorphism
- graph representations
- reachability queries
- spanning tree
- bipartite graph
- dynamic graph
- graph data
- maximum clique
- minimum spanning tree
- structural pattern recognition
- graph transformation
- graph drawing
- average degree
- disk resident
- graph kernels
- dense subgraphs
- association graph
- inexact graph matching
- social graphs
- real world graphs
- graph layout
- maximum common subgraph
- connected dominating set
- neighborhood graph
- maximum cardinality
- directed acyclic
- structured data
- edge weights
- spectral decomposition
- maximum independent set
- attributed graphs
- maximal cliques
- community discovery
- graph patterns
- small world
- web graph
- evolving graphs
- hyper graph
- shortest path
- graphical models
- random walk
- query graph
- directed acyclic graph
- fully connected
- topological information
- adjacency graph
- degree distribution