Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker.
Daniel W. CranstonLandon RabernPublished in: Eur. J. Comb. (2015)
Keyphrases
- graph representation
- color images
- equivalence class
- weighted graph
- spanning tree
- random walk
- graph structure
- dependency graph
- structured data
- connected components
- directed acyclic graph
- graph theory
- graph search
- search algorithm
- graph clustering
- color distribution
- graph construction
- color matching
- adjacency matrix
- graph based algorithm
- data sets
- graphical representation
- graph model
- graph matching
- color space
- graphical models
- small number
- knn
- xml documents
- neural network