Metraipolis › archive › dc_3dfe18f96013
Graph factorization — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Graph_factorization
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T17:34:09.531Z
- SHA-256 of the archived text
f11c9e5a869f7ef48978dd55a964a2a26de760cf00aec5b9b94d65a6e654c1a8- Stable URL of this page
https://metraipolis.com/documento/dc_3dfe18f96013
How to cite
Graph factorization — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Graph_factorization (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_3dfe18f96013 (Metraipolis archive dc_3dfe18f96013, sha256 f11c9e5a869f7ef48978dd55a964a2a26de760cf00aec5b9b94d65a6e654c1a8)
BibTeX
@misc{dc3dfe18f96013,
title = {Graph factorization — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Graph_factorization},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_3dfe18f96013; sha256 f11c9e5a869f7ef48978dd55a964a2a26de760cf00aec5b9b94d65a6e654c1a8},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Graph_factorization. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 a proper edge coloring with k colors. A 2-factor is a collection of disjoint cycles that spans all vertices of the graph. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»). Fonte: Wikipedia in inglese, voce «Graph factorization» — https://en.wikipedia.org/wiki/Graph_factorization Wikidata Q5597083 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5597083 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Graph_factorization?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1344232031, consultata il 2026-10-06T16:01:04.203Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a7fc88797058e4e18eb2781068bcbd6666e4aaacc1c8d1f7d289ce71ebcab9e5