Matches in DBpedia 2014 for { ?s ?p In graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals the number of maximal cliques.. }
Showing items 1 to 1 of
1
with 100 items per page.