Login / Signup
Sufficient conditions for a graph to be edge-colorable with maximum degree colors.
Raphael C. S. Machado
Celina M. H. de Figueiredo
Published in:
Electron. Notes Discret. Math. (2008)
Keyphrases
</>
sufficient conditions
weighted graph
undirected graph
edge weights
graph structure
directed graph
asymptotic stability
random walk
fixed point
equilibrium point
color images
exponential stability
lyapunov function
linear systems
linear complementarity problem
semidefinite
efficiently computable
optimal policy