Preferred language:

This is the default search language used by BabelNet
Select the main languages you wish to use in BabelNet:
Selected languages will be available in the dropdown menus and in BabelNet entries

### Z

all preferred languages
•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# الرسم البياني الكمال مسلي From automatic translation 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# No term available 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26     •     Categories: Graph families, Perfect graphs

# Trivially perfect graph · Aborescent comparability graph · Comparability graph of trees · Comparability graphs of trees · Quasi-threshold graph

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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# No term available 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# No term available 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# επιπόλαια τέλεια γράφημα From automatic translation 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# No term available 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# No term available 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# grafico banalmente perfetto From automatic translation 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# No term available 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. Wikipedia

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# граф сравнимости деревьев · древовидный граф сравнимости · квазипороговый граф · тривиально-совершенный граф · тривиально совершенный граф

Граф со свойством, что в каждом его порождённом подграфе размер максимального (по размеру) независимого множества равен числу максимальных клик Wikidata

•     bn:01043271n     •     NOUN     •     Concept    •     Updated on 2019/07/26

# No term available 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. Wikipedia

## Translations

الرسم البياني الكمال مسلي
trivially perfect graph, aborescent comparability graph, comparability graph of trees, comparability graphs of trees, quasi-threshold graph
επιπόλαια τέλεια γράφημα
grafico banalmente perfetto
граф сравнимости деревьев, древовидный граф сравнимости, квазипороговый граф, тривиально-совершенный граф, тривиально совершенный граф, тривиально идеальный график

## Sources

### Translations from Wikipedia sentences

الرسم البياني الكمال مسلي
επιπόλαια τέλεια γράφημα
тривиально идеальный график
1 source | 1 sense
3 sources | 6 senses
1 source | 1 sense
1 source | 1 sense
2 sources | 6 senses

## Other forms

### BabelNet

trivially perfect