A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees.
Thomas PerrettPublished in: Discret. Math. (2016)
Keyphrases
- spanning tree
- leaf nodes
- minimum spanning tree
- minimum spanning trees
- minimum cost
- edge disjoint
- undirected graph
- minimum weight
- color images
- weighted graph
- root node
- edge weights
- depth first search
- minimum total cost
- neural network
- human perception
- color information
- computational complexity
- heat kernel
- decision trees