New lower bounds for the size of edge chromatic critical graphs.
Yue ZhaoPublished in: J. Graph Theory (2004)
Keyphrases
- lower bound
- upper bound
- weighted graph
- maximal cliques
- edge information
- maximum clique
- running times
- undirected graph
- computational complexity
- branch and bound algorithm
- color information
- upper and lower bounds
- graph theoretic
- graph theory
- objective function
- branch and bound
- directed graph
- edge detection
- worst case
- memory requirements
- graph mining
- edge detector
- graph databases
- graph partitioning
- vc dimension
- color images
- optimal solution