Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Download
Faster access than browser!
 

Cograph and Kruskal's tree theorem

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Cograph and Kruskal's tree theorem

Cograph vs. Kruskal's tree theorem

In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union. In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding.

Similarities between Cograph and Kruskal's tree theorem

Cograph and Kruskal's tree theorem have 1 thing in common (in Unionpedia): Well-quasi-ordering.

Well-quasi-ordering

In mathematics, specifically order theory, a well-quasi-ordering or wqo is a quasi-ordering such that any infinite sequence of elements x_0, x_1, x_2, … from X contains an increasing pair x_i\le x_j with i.

Cograph and Well-quasi-ordering · Kruskal's tree theorem and Well-quasi-ordering · See more »

The list above answers the following questions

Cograph and Kruskal's tree theorem Comparison

Cograph has 59 relations, while Kruskal's tree theorem has 22. As they have in common 1, the Jaccard index is 1.23% = 1 / (59 + 22).

References

This article shows the relationship between Cograph and Kruskal's tree theorem. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »