EUVIMEDEUVIMED entdecken
Crossref

Corrigendum to “2-Factors in 1-Tough Graphs Whose Independence Number Exceeds the Vertex-Connectivity” [Discrete Appl. Math. 377 (2025) 162–169]

Michael Yatauro

Discrete Applied Mathematics · 2026-10 · 391 · 538-539

DOI: 10.1016/j.dam.2026.05.014 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-10. Verfasst von Michael Yatauro.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Yatauro, M. (2026). Corrigendum to “2-Factors in 1-Tough Graphs Whose Independence Number Exceeds the Vertex-Connectivity” [Discrete Appl. Math. 377 (2025) 162–169]. Discrete Applied Mathematics, 391, 538-539. https://doi.org/10.1016/j.dam.2026.05.014

Vancouver

Yatauro M. Corrigendum to “2-Factors in 1-Tough Graphs Whose Independence Number Exceeds the Vertex-Connectivity” [Discrete Appl. Math. 377 (2025) 162–169]. Discrete Applied Mathematics. 2026;391:538-539. doi:10.1016/j.dam.2026.05.014

BibTeX
@article{Yatauro2026,
  author = {Yatauro, Michael},
  title = {Corrigendum to “2-Factors in 1-Tough Graphs Whose Independence Number Exceeds the Vertex-Connectivity” [Discrete Appl. Math. 377 (2025) 162–169]},
  journal = {Discrete Applied Mathematics},
  year = {2026},
  volume = {391},
  pages = {538--539},
  doi = {10.1016/j.dam.2026.05.014}
}
Kostenlos starten →