Multipartite graph, a Common card

The card carries these facts from its Wikipedia article.

• Equivalently, it is a graph that can be colored with k colors, so that no two endpoints of an edge have the same color.
• When k = 2 these are the bipartite graphs, and when k = 3 they are called the tripartite graphs.
• Bipartite graphs may be recognized in polynomial time but, for any k > 2 it is NP-complete, given an uncolored graph, to test whether it is k-partite.

Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Multipartite graph article was read about 7,200 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 44 and blocks with 18: each hit it takes is cut by 7 %.

Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.

The cards just above and just below Multipartite graph in the power ranking, all domains together.