EUVIMEDEUVIMED entdecken
Crossref

A sharp upper bound for the number of connected sets in any grid graph

Hongxia Ma, Xian'an Jin, Weiling Yang, Meiqiao Zhang

Discrete Mathematics · 2026-09 · 349 (9) · 115162

DOI: 10.1016/j.disc.2026.115162 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics, 2026-09. Verfasst von Hongxia Ma und 3 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Gefördert von: Natural Science Foundation of Xiamen Municipality, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Natural Science Foundation of Xiamen Municipality
  • National Natural Science Foundation of China

Zitieren

APA

Ma, H., Jin, X., Yang, W., & Zhang, M. (2026). A sharp upper bound for the number of connected sets in any grid graph. Discrete Mathematics, 349(9), 115162. https://doi.org/10.1016/j.disc.2026.115162

Vancouver

Ma H, Jin X, Yang W, Zhang M. A sharp upper bound for the number of connected sets in any grid graph. Discrete Mathematics. 2026;349(9):115162. doi:10.1016/j.disc.2026.115162

BibTeX
@article{Ma2026,
  author = {Ma, Hongxia and Jin, Xian'an and Yang, Weiling and Zhang, Meiqiao},
  title = {A sharp upper bound for the number of connected sets in any grid graph},
  journal = {Discrete Mathematics},
  year = {2026},
  volume = {349},
  number = {9},
  pages = {115162},
  doi = {10.1016/j.disc.2026.115162}
}
Kostenlos starten →