A Condition for the Three Colourability of Planar Locally Path Graphs.
Ajit A. DiwanN. UsharaniPublished in: FSTTCS (1995)
Keyphrases
- planar graphs
- sufficient conditions
- graph theoretic
- graph matching
- shortest path
- graph theory
- graph structure
- graph mining
- finding the shortest path
- single point
- graph databases
- data sets
- weighted graph
- directed graph
- graph model
- endpoints
- ground plane
- planar surfaces
- graph clustering
- series parallel
- pattern recognition
- search algorithm