{"version":"1.0","type":"link","title":"Multipartite graph - Newikis","description":"In graph theory, a part of mathematics, a k-partite graph is a graph whose vertices are (or can be) partitioned into k different independent sets. Equivalently, it is a graph that can be colored with k colors, so that no two endpoints of an edge have the same color. When k = 2 these are the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/d/d3/Complex_tripartite_graph_octahedron.svg/1280px-Complex_tripartite_graph_octahedron.svg.png","thumbnail_width":1280,"thumbnail_height":1280}