EUVIMEDEUVIMED entdecken
Crossref

The Square of Every Subcubic Planar Graph Without 4-cycles and 5-cycles is 7-choosable

Ligang Jin, Yingli Kang, Seog-Jin Kim

Graphs and Combinatorics · 2026-04 · 42 (2)

DOI: 10.1007/s00373-026-03032-w ↗

Kurz gefasst

Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 04.03.2026. Verfasst von Ligang Jin und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 16 Literaturangaben. Gefördert von: National Outstanding Youth Science Fund Project of National Natural Science Foundation of China, Konkuk University, ZJNSF.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The square of a graph $G$, denoted by $G^2$, has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$. Thomassen (2018) and independently, Hartke, Jahanbekam and Thomas (2016) proved that $\chi(G^2) \leq 7$ if $G$ is a subcubic planar graph. A natural question is whether $\chi_{\ell}(G^2) \leq 7$ or not if $G$ is a subcubic planar graph. Recently, Kim and Lian (2024) proved that $\chi_{\ell}(G^2) \leq 7$ if $G$ is a subcubic planar graph of girth at least 6. In this paper, we prove that $\chi_{\ell}(G^2) \leq 7$ if $G$ is a subcubic planar graph without 4-cycles and 5-cycles, which improves the result of Kim and Lian.

Förderung

  • National Outstanding Youth Science Fund Project of National Natural Science Foundation of China
  • Konkuk University
  • ZJNSF
  • National Natural Science Foundation of China

Zitieren

APA

Jin, L., Kang, Y., & Kim, S. (2026). The Square of Every Subcubic Planar Graph Without 4-cycles and 5-cycles is 7-choosable. Graphs and Combinatorics, 42(2). https://doi.org/10.1007/s00373-026-03032-w

Vancouver

Jin L, Kang Y, Kim S. The Square of Every Subcubic Planar Graph Without 4-cycles and 5-cycles is 7-choosable. Graphs and Combinatorics. 2026;42(2). doi:10.1007/s00373-026-03032-w

BibTeX
@article{Jin2026,
  author = {Jin, Ligang and Kang, Yingli and Kim, Seog-Jin},
  title = {The Square of Every Subcubic Planar Graph Without 4-cycles and 5-cycles is 7-choosable},
  journal = {Graphs and Combinatorics},
  year = {2026},
  volume = {42},
  number = {2},
  doi = {10.1007/s00373-026-03032-w}
}
Kostenlos starten →