Login / Signup

The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4.

Haicheng MaHaizhen Ren
Published in: Discret. Math. (2008)
Keyphrases
  • equivalence classes
  • equivalence class
  • directed acyclic graph
  • bayesian network structures
  • color images
  • directed graph
  • minimum cost
  • spanning tree
  • dynamic programming
  • color information
  • graph theoretic