Metraipolis › archive › dc_7d71085d4013
Bramble (graph theory) — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Bramble_(graph_theory)
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T18:48:29.283Z
- SHA-256 of the archived text
5976b351b17d3d1d5fb6db761d72c9c975835913669bea3becf578790c5dd73b- Stable URL of this page
https://metraipolis.com/documento/dc_7d71085d4013
How to cite
Bramble (graph theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Bramble_(graph_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_7d71085d4013 (Metraipolis archive dc_7d71085d4013, sha256 5976b351b17d3d1d5fb6db761d72c9c975835913669bea3becf578790c5dd73b)
BibTeX
@misc{dc7d71085d4013,
title = {Bramble (graph theory) — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Bramble_(graph_theory)},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_7d71085d4013; sha256 5976b351b17d3d1d5fb6db761d72c9c975835913669bea3becf578790c5dd73b},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Bramble_(graph_theory). Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In graph theory, a bramble for an undirected graph G is a family of connected subgraphs of G that all touch each other: for every pair of disjoint subgraphs, there must exist an edge in G that has one endpoint in each subgraph. The order of a bramble is the smallest size of a hitting set, a set of vertices of G that has a nonempty intersection with each of the subgraphs. Brambles may be used to characterize the treewidth of G. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»). Fonte: Wikipedia in inglese, voce «Bramble (graph theory)» — https://en.wikipedia.org/wiki/Bramble_(graph_theory) Wikidata Q4956109 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4956109 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Bramble_(graph_theory)?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 1335654220, consultata il 2026-10-15T18:09:34.189Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 183326f6101ab1934bb7ca19fda77671e9a80816bac25f96b8d30c981fa56b81