Login / Signup

Hitting all maximum cliques with a stable set using lopsided independent transversals.

Andrew D. King
Published in: J. Graph Theory (2011)
Keyphrases
  • stable set
  • maximum matching
  • graph structure
  • relational databases
  • markov chain