EUVIMEDEUVIMED entdecken
Crossref

A short proof that every claw-free cubic graph is (1,1,2,2)-packing colorable

Maidoun Mortada, Ayman El Zein

Discrete Applied Mathematics · 2026-10 · 391 · 24-27

DOI: 10.1016/j.dam.2026.04.028 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-10. Verfasst von Maidoun Mortada und 1 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben. Gefördert von: Simons Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Simons Foundation

Zitieren

APA

Mortada, M., & Zein, A. E. (2026). A short proof that every claw-free cubic graph is (1,1,2,2)-packing colorable. Discrete Applied Mathematics, 391, 24-27. https://doi.org/10.1016/j.dam.2026.04.028

Vancouver

Mortada M, Zein AE. A short proof that every claw-free cubic graph is (1,1,2,2)-packing colorable. Discrete Applied Mathematics. 2026;391:24-27. doi:10.1016/j.dam.2026.04.028

BibTeX
@article{Mortada2026,
  author = {Mortada, Maidoun and Zein, Ayman El},
  title = {A short proof that every claw-free cubic graph is (1,1,2,2)-packing colorable},
  journal = {Discrete Applied Mathematics},
  year = {2026},
  volume = {391},
  pages = {24--27},
  doi = {10.1016/j.dam.2026.04.028}
}
Kostenlos starten →