Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5597083> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Q5597083 subject Q7217283.
- Q5597083 abstract "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 admits a k-factorization. In particular, a 1-factor is a perfect matching, and a 1-factorization of a k-regular graph is an edge coloring with k colors. A 2-factor is a collection of cycles that spans all vertices of the graph.".
- Q5597083 thumbnail Desargues_graph_3color_edge.svg?width=300.
- Q5597083 wikiPageExternalLink gtwa.html.
- Q5597083 wikiPageExternalLink 1fact.html.
- Q5597083 wikiPageExternalLink graph.theory.
- Q5597083 wikiPageExternalLink newP1F.html.
- Q5597083 wikiPageWikiLink Q1050972.
- Q5597083 wikiPageWikiLink Q1065144.
- Q5597083 wikiPageWikiLink Q131476.
- Q5597083 wikiPageWikiLink Q166507.
- Q5597083 wikiPageWikiLink Q174733.
- Q5597083 wikiPageWikiLink Q176916.
- Q5597083 wikiPageWikiLink Q245595.
- Q5597083 wikiPageWikiLink Q273037.
- Q5597083 wikiPageWikiLink Q319141.
- Q5597083 wikiPageWikiLink Q343171.
- Q5597083 wikiPageWikiLink Q455001.
- Q5597083 wikiPageWikiLink Q45715.
- Q5597083 wikiPageWikiLink Q5282038.
- Q5597083 wikiPageWikiLink Q536640.
- Q5597083 wikiPageWikiLink Q591217.
- Q5597083 wikiPageWikiLink Q624580.
- Q5597083 wikiPageWikiLink Q7113657.
- Q5597083 wikiPageWikiLink Q714886.
- Q5597083 wikiPageWikiLink Q7217283.
- Q5597083 wikiPageWikiLink Q790236.
- Q5597083 wikiPageWikiLink Q826467.
- Q5597083 wikiPageWikiLink Q835614.
- Q5597083 wikiPageWikiLink Q840247.
- Q5597083 wikiPageWikiLink Q841144.
- Q5597083 wikiPageWikiLink Q913598.
- Q5597083 type Thing.
- Q5597083 comment "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 admits a k-factorization. In particular, a 1-factor is a perfect matching, and a 1-factorization of a k-regular graph is an edge coloring with k colors.".
- Q5597083 label "Graph factorization".
- Q5597083 differentFrom Q5428725.
- Q5597083 depiction Desargues_graph_3color_edge.svg.