Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable.
Yingqian WangXianghua MaoZhengke MiaoPublished in: J. Graph Theory (2013)
Keyphrases
- three dimensional
- random graphs
- graph theoretic
- graph matching
- graph mining
- computer vision
- case study
- genetic algorithm
- directed graph
- graph structure
- graph construction
- structured objects
- series parallel
- graph structures
- graph clustering
- power law
- graph representation
- undirected graph
- graph databases
- hough transform
- image segmentation