EUVIMEDEUVIMED entdecken
Crossref

On the 3‐Colorability of Triangle‐Free and Fork‐Free Graphs

Joshua Schroeder, Zhiyu Wang, Xingxing Yu

Journal of Graph Theory · 30.07.2026

DOI: 10.1002/jgt.70105 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 30.07.2026. Verfasst von Joshua Schroeder und 2 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A graph is said to satisfy the Vizing bound if , where and denote the chromatic number and clique number of , respectively. It was conjectured by Randerath in 1998 that if is a triangle‐free and fork‐free graph, where the fork (also known as trident) is obtained from by subdividing two edges, then satisfies the Vizing bound. In this paper, we confirm this conjecture.

Förderung

  • National Science Foundation

Zitieren

APA

Schroeder, J., Wang, Z., & Yu, X. (2026). On the 3‐Colorability of Triangle‐Free and Fork‐Free Graphs. Journal of Graph Theory. https://doi.org/10.1002/jgt.70105

Vancouver

Schroeder J, Wang Z, Yu X. On the 3‐Colorability of Triangle‐Free and Fork‐Free Graphs. Journal of Graph Theory. 2026. doi:10.1002/jgt.70105

BibTeX
@article{Schroeder2026,
  author = {Schroeder, Joshua and Wang, Zhiyu and Yu, Xingxing},
  title = {On the 3‐Colorability of Triangle‐Free and Fork‐Free Graphs},
  journal = {Journal of Graph Theory},
  year = {2026},
  doi = {10.1002/jgt.70105}
}
Kostenlos starten →