EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Disjoint Total Dominating Sets in Planar Graphs

Eva Rotenberg, Daniel Rutschmann, Carsten Thomassen

Journal of Graph Theory · 2026-07 · 112 (3) · 290-295

DOI: 10.1002/jgt.70032 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 30.03.2026. Verfasst von Eva Rotenberg und 2 weiteren Autor:innen. Die Arbeit nennt 5 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The vertex set of any planar graph of minimum degree at least 3 can be colored in two colors so that every vertex has a neighbor of each color. If the graph is a planar triangulation, the coloring can be chosen such that every vertex has a neighbor of its own color and at least two neighbors of the opposite color.

Zitieren

APA

Rotenberg, E., Rutschmann, D., & Thomassen, C. (2026). Disjoint Total Dominating Sets in Planar Graphs. Journal of Graph Theory, 112(3), 290-295. https://doi.org/10.1002/jgt.70032

Vancouver

Rotenberg E, Rutschmann D, Thomassen C. Disjoint Total Dominating Sets in Planar Graphs. Journal of Graph Theory. 2026;112(3):290-295. doi:10.1002/jgt.70032

BibTeX
@article{Rotenberg2026,
  author = {Rotenberg, Eva and Rutschmann, Daniel and Thomassen, Carsten},
  title = {Disjoint Total Dominating Sets in Planar Graphs},
  journal = {Journal of Graph Theory},
  year = {2026},
  volume = {112},
  number = {3},
  pages = {290--295},
  doi = {10.1002/jgt.70032}
}
Kostenlos starten →