EUVIMEDEUVIMED entdecken
Crossref

Signed list edge coloring in graphs of bounded treewidth

Li Zhang, You Lu, Zhengke Miao, Yintao Wang

Discrete Applied Mathematics · 2027-01 · 396 · 8-16

DOI: 10.1016/j.dam.2026.08.020 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2027-01. Verfasst von Li Zhang und 3 weiteren Autor:innen. Die Arbeit nennt 21 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Vizing conjectured that the list edge chromatic number of any graph with maximum degree $\Delta$ is at most $\Delta + 1$. This conjecture has been confirmed for several important classes of graphs, in particular, Lang proved that it holds for all graphs of treewidth $3$. In this paper, we introduce the list edge coloring of signed graphs, a framework that generalizes both classical list edge coloring and the signed edge coloring introduced by Behr. We extend Lang's result by proving the signed analogue of Vizing's conjecture for all signed graphs of treewidth $3$, as well as for signed graphs of treewidth $4$ with maximum degree $\Delta \ge 10$.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Zhang, L., Lu, Y., Miao, Z., & Wang, Y. (2027). Signed list edge coloring in graphs of bounded treewidth. Discrete Applied Mathematics, 396, 8-16. https://doi.org/10.1016/j.dam.2026.08.020

Vancouver

Zhang L, Lu Y, Miao Z, Wang Y. Signed list edge coloring in graphs of bounded treewidth. Discrete Applied Mathematics. 2027;396:8-16. doi:10.1016/j.dam.2026.08.020

BibTeX
@article{Zhang2027,
  author = {Zhang, Li and Lu, You and Miao, Zhengke and Wang, Yintao},
  title = {Signed list edge coloring in graphs of bounded treewidth},
  journal = {Discrete Applied Mathematics},
  year = {2027},
  volume = {396},
  pages = {8--16},
  doi = {10.1016/j.dam.2026.08.020}
}
Kostenlos starten →