Metraipolis › archive › dc_ae36ac117a4e

Claw-free minimal factor-critical and bicritical graphs — arXiv:2611.09072

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.09072
License (as archived)
CC0-1.0
Archived
2026-11-09T22:43:48.591Z
SHA-256 of the archived text
1d65e35f4f8720de01bd6501f49767397cfbc5fee7a759bb2b972f66ec256b87
Stable URL of this page
https://metraipolis.com/documento/dc_ae36ac117a4e

How to cite

Claw-free minimal factor-critical and bicritical graphs — arXiv:2611.09072 — arXiv (en), https://arxiv.org/abs/2611.09072 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ae36ac117a4e (Metraipolis archive dc_ae36ac117a4e, sha256 1d65e35f4f8720de01bd6501f49767397cfbc5fee7a759bb2b972f66ec256b87)
BibTeX
@misc{dcae36ac117a4e,
  title = {Claw-free minimal factor-critical and bicritical graphs — arXiv:2611.09072},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.09072},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ae36ac117a4e; sha256 1d65e35f4f8720de01bd6501f49767397cfbc5fee7a759bb2b972f66ec256b87},
  year = {2026}
}

Archived text

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

A graph $G$ is called $k$-factor-critical if $G-S$ has a perfect matching for every subset $S\subseteq V(G)$ with $|S|=k$, and is minimal if $G-e$ is not $k$-factor-critical for every edge $e$ of $G$. The cases $k=1$ and $k=2$ correspond to factor-critical and bicritical graphs, respectively. In this paper, we obtain complete structural characterizations of claw-free minimal factor-critical graphs and claw-free minimal bicritical graphs. The former is characterized by ear decompositions. For the latter, we first characterize the $3$-connected case using the theory of line graphs and then extend the characterization to the general case by a suitable $2$-sum operation.

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.09072 — 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-09T22:36:32.141Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).