Metraipolis › archive › dc_7b95cb99e216

Girth (graph theory) — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Girth_(graph_theory)
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-06T12:51:34.294Z
SHA-256 of the archived text: a28ad651bfd6bacea2c52ec3f9595725ee94756237ba333204d6bc18b17a5c13
Stable URL of this page: https://metraipolis.com/documento/dc_7b95cb99e216

How to cite

Girth (graph theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Girth_(graph_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_7b95cb99e216 (Metraipolis archive dc_7b95cb99e216, sha256 a28ad651bfd6bacea2c52ec3f9595725ee94756237ba333204d6bc18b17a5c13)

BibTeX

@misc{dc7b95cb99e216,
  title = {Girth (graph theory) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Girth_(graph_theory)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_7b95cb99e216; sha256 a28ad651bfd6bacea2c52ec3f9595725ee94756237ba333204d6bc18b17a5c13},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Girth_(graph_theory). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that is, it is a forest), its girth is defined to be infinity. For example, a 4-cycle (square) has girth 4. A grid has girth 4 as well, and a triangular mesh has girth 3. A graph with girth four or more is triangle-free.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Girth (graph theory)» — https://en.wikipedia.org/wiki/Girth_(graph_theory)
Wikidata Q959831: «lunghezza del ciclo più corto contenuto nel grafo» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q959831
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Girth_(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 1263898278, consultata il 2026-10-06T11:07:58.640Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 6b4053e0883587d9810bc879bbf049ab00c1b262132f59cac2aeff9bef9f1d00