An upper bound for total colouring of graphs.
Colin J. H. McDiarmidAbdón Sánchez-ArroyoPublished in: Discret. Math. (1993)
Keyphrases
- upper bound
- lower bound
- worst case
- upper and lower bounds
- lower and upper bounds
- branch and bound algorithm
- graph databases
- branch and bound
- random graphs
- structured objects
- graph structure
- graph theoretic
- error probability
- weighted graph
- generalization error
- pattern recognition
- undirected graph
- graph representation
- directed graph
- graph clustering