Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.
Yiqiao WangXiaoxue HuWeifan WangKo-Wei LihPublished in: J. Graph Theory (2020)
Keyphrases
- weighted graph
- undirected graph
- edge detection
- random graphs
- edge information
- three dimensional
- facial expressions
- human faces
- edge segments
- adjacency graph
- edge weights
- face images
- graph mining
- bipartite graph
- minimum spanning trees
- graph theoretic
- graph clustering
- recognition algorithm
- spanning tree
- graph matching
- maximum number
- facial features
- graph kernels
- d objects
- degree distribution
- power law
- edge detector
- graph databases
- approximation algorithms