K-partite graph: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    17 November 2014

    • curprev 19:5319:53, 17 November 2014‎ BB91 talk contribs‎ 536 bytes +536‎ Created page with "==Definition== An undirected graph <math>G=(V,E)</math> is called '''k-partite''', if there is a partition of <math>V</math>, hereinafter referred to as <math>V=\dot\cup_{i=1..."
Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/K-partite_graph"