EUVIMEDEUVIMED entdecken
Crossref

B‐Coloring of Planar Graphs

Jiangxu Kong, Yiqiao Wang, Mengmeng Zheng

Journal of Graph Theory · 2026-10 · 113 (2) · 274-285

DOI: 10.1002/jgt.70067 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 16.05.2026. Verfasst von Jiangxu Kong und 2 weiteren Autor:innen. Die Arbeit nennt 8 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let denote the minimum number of colors needed to properly color the edges of a graph such that every 4‐cycle is colored with four different colors. Very recently, Gyárfás et al. [3] proved that for a planar graph and for an outerplanar graph except and . They also conjectured that, when is large enough, every planar graph has and every outerplanar graph has . Let be a planar graph. In this paper, we show the following results: (1) ; (2) if ; (3) if ; (4) if is outerplanar and . Results (3) and (4) confirm the conjectures of Gyárfás et al. [3].

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Kong, J., Wang, Y., & Zheng, M. (2026). B‐Coloring of Planar Graphs. Journal of Graph Theory, 113(2), 274-285. https://doi.org/10.1002/jgt.70067

Vancouver

Kong J, Wang Y, Zheng M. B‐Coloring of Planar Graphs. Journal of Graph Theory. 2026;113(2):274-285. doi:10.1002/jgt.70067

BibTeX
@article{Kong2026,
  author = {Kong, Jiangxu and Wang, Yiqiao and Zheng, Mengmeng},
  title = {B‐Coloring of Planar Graphs},
  journal = {Journal of Graph Theory},
  year = {2026},
  volume = {113},
  number = {2},
  pages = {274--285},
  doi = {10.1002/jgt.70067}
}
Kostenlos starten →