EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A New Four-Color Problem

Salman Ghazal

AppliedMath · 13.08.2026 · 6 (8) · 133

DOI: 10.3390/appliedmath6080133 ↗

Kurz gefasst

Fachartikel in der Zeitschrift AppliedMath, online erschienen am 13.08.2026. Verfasst von Salman Ghazal. Die Arbeit nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Suppose that T is a normal spanning tree (depth-first search tree) of a graph G. If e=xy and e′=uv are edges of G, satisfying x≺Tu≺Ty≺Tv, then they are called secant edges of G with respect to T. Suppose that G has no secant edges with respect to T. If T is a path, Ghazal and Al-Mniny proved that the chromatic number is at most 3. We conjecture that there is a positive constant γ such that, for any graph G that has no secant edges with respect to a normal spanning tree T, then χ(G)≤γ. We pose the problem of whether γ=4 suffices. We establish a positive answer in the case where T has at most one node.

Zitieren

APA

Ghazal, S. (2026). A New Four-Color Problem. AppliedMath, 6(8), 133. https://doi.org/10.3390/appliedmath6080133

Vancouver

Ghazal S. A New Four-Color Problem. AppliedMath. 2026;6(8):133. doi:10.3390/appliedmath6080133

BibTeX
@article{Ghazal2026,
  author = {Ghazal, Salman},
  title = {A New Four-Color Problem},
  journal = {AppliedMath},
  year = {2026},
  volume = {6},
  number = {8},
  pages = {133},
  doi = {10.3390/appliedmath6080133}
}
Kostenlos starten →