The size of edge chromatic critical graphs with maximum degree 6.
Rong LuoLianying MiaoYue ZhaoPublished in: J. Graph Theory (2009)
Keyphrases
- maximum number
- weighted graph
- maximal cliques
- database
- undirected graph
- minimum spanning trees
- random graphs
- color images
- edge detection
- edge weights
- graph matching
- graph theory
- uniform random
- bounded treewidth
- graph theoretic
- graph databases
- computational complexity
- phase transition
- edge detector
- directed graph
- similarity measure
- image segmentation
- maximum clique
- image processing
- data sets