Login / Signup

(P, Q)-Total (r, s)-colorings of graphs.

Arnfried KemnitzMassimiliano MarangioAnja PruchnewskiMargit Voigt
Published in: Discret. Math. (2015)
Keyphrases
  • graph databases
  • graph theory
  • graph mining
  • graph theoretic
  • graph structures
  • lower bound
  • simulated annealing
  • complex structures
  • graph partitioning
  • graph construction
  • graph coloring
  • series parallel
  • graph isomorphism