Metraipolis › archive › dc_c418eed7393f

Contractable 2-connected subgraphs in minimally 3-connected graphs — arXiv:2611.01588

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01588
License (as archived)
CC0-1.0
Archived
2026-11-03T11:37:18.483Z
SHA-256 of the archived text
a84485e78f08e0e5eb58e9e2ef65305750401217f3a09edd460f16453ed2b9fd
Stable URL of this page
https://metraipolis.com/documento/dc_c418eed7393f

How to cite

Contractable 2-connected subgraphs in minimally 3-connected graphs — arXiv:2611.01588 — arXiv (en), https://arxiv.org/abs/2611.01588 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c418eed7393f (Metraipolis archive dc_c418eed7393f, sha256 a84485e78f08e0e5eb58e9e2ef65305750401217f3a09edd460f16453ed2b9fd)
BibTeX
@misc{dcc418eed7393f,
  title = {Contractable 2-connected subgraphs in minimally 3-connected graphs — arXiv:2611.01588},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01588},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c418eed7393f; sha256 a84485e78f08e0e5eb58e9e2ef65305750401217f3a09edd460f16453ed2b9fd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01588. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the 2-connected subgraphs of minimally 3-connected graphs whose contraction preserves 3-connectedness. We show that every minimally 3-connected graph that is not a wheel or a complete bipartite graph $K_{3,n}$ contains a contractable 2-connected induced subgraph that is a cycle, a fan, a $K_{2,n}$ or a $K_{3,n}$. In addition, these subgraphs satisfy certain degree restrictions. We show that none of these four families can be discarded since for each one of the four families, there exists a minimally 3-connected graph containing a contractable induced 2-connected subgraph in that family and none in the other three families. Reversing the contraction process gives a new construction for 3-connected graphs using edge addition, expansions into prescribed 2-connected subgraphs and $Y$-sum.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01588 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:22.275Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).