Some upper bounds on the total and list chromatic numbers of multigraphs.
Roland HäggkvistAmanda G. ChetwyndPublished in: J. Graph Theory (1992)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- tight bounds
- communication networks
- branch and bound
- lower and upper bounds
- color images
- branch and bound algorithm
- error probability
- material handling
- sample size
- generalization error
- sample complexity
- vc dimension
- model selection
- real numbers
- training data
- information systems
- neural network