Independence, cliques and domination

Independent sets, cliques and dominating sets in graphs, with bounds on their sizes and polynomials counting them.

• Caro–Wei theorem
• Dominating sets
• Domination in rook graphs
• Domination polynomials of grids
• Fibonacci numbers of graphs
• Independence polynomial of claw-free graphs
• Maximal cliques and triangles
• Odd independent sets

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.