Metraipolis › archive › dc_fb64d561f959

On the Restricted Edge-Cuts of Optimal 1-Planar Graphs — arXiv:2608.13015

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13015
License (as archived)
CC0-1.0
Archived
2026-10-19T04:50:13.374Z
SHA-256 of the archived text
7443242b74f0430c341ae5048f83806e5663e55528660c2b66e9597d3f741775
Stable URL of this page
https://metraipolis.com/documento/dc_fb64d561f959

How to cite

On the Restricted Edge-Cuts of Optimal 1-Planar Graphs — arXiv:2608.13015 — arXiv (en), https://arxiv.org/abs/2608.13015 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb64d561f959 (Metraipolis archive dc_fb64d561f959, sha256 7443242b74f0430c341ae5048f83806e5663e55528660c2b66e9597d3f741775)
BibTeX
@misc{dcfb64d561f959,
  title = {On the Restricted Edge-Cuts of Optimal 1-Planar Graphs — arXiv:2608.13015},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13015},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb64d561f959; sha256 7443242b74f0430c341ae5048f83806e5663e55528660c2b66e9597d3f741775},
  year = {2026}
}

Archived text

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

The restricted edge-connectivity of a graph is the minimum size of an edge-cut whose removal leaves every component with at least two vertices. In 2024, Zhang et al. showed that the restricted edge-connectivity of any optimal $1$-planar graph belongs to $\{8,10,12\}$. In this paper, we exclude $8$ as a possible value, thereby proving that the restricted edge-connectivity is either $10$ or $12$, and both values are attainable. Furthermore, we show that the restricted edge-connectivity of a 6-connected optimal 1-planar graph equals $10$ if and only if the graph contains an edge whose two endvertices both have degree $6$. As a key ingredient, we characterize the structure of vertex-induced subgraphs on $n$ vertices with $4n-9$ edges in optimal 1-planar graphs, and use this characterization to establish a connection between restricted edge-cuts and vertex-cuts in optimal 1-planar graphs.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.13015 — 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-10-19T04:28:16.165Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).