{"version":"1.0","type":"link","title":"Graph factorization - Newikis","description":"In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a spanning k-regular subgraph, and a k-factorization partitions the edges of the graph into disjoint k-factors. A graph G is said to be k-factorable if it…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/0/03/Desargues_graph_3color_edge.svg/1280px-Desargues_graph_3color_edge.svg.png","thumbnail_width":1280,"thumbnail_height":1280}