Domination in 4‐Regular Graphs With No Induced 4‐Cycles
Journal of Graph Theory · 2026-06 · 112 (2) · 62-95
DOI: 10.1002/jgt.70013 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 06.03.2026. Verfasst von Michael A. Henning und 1 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
A set of vertices in a graph is a dominating set of if every vertex not in is adjacent to a vertex in . The domination number of , denoted by , is the minimum cardinality of a dominating set in . The ‐conjecture for domination in 4‐regular graphs states that if is a 4‐regular graph of order , then . We prove this conjecture when has no induced 4‐cycle.
Zitieren
APA
Henning, M. A., & Yeo, A. (2026). Domination in 4‐Regular Graphs With No Induced 4‐Cycles. Journal of Graph Theory, 112(2), 62-95. https://doi.org/10.1002/jgt.70013
Vancouver
Henning MA, Yeo A. Domination in 4‐Regular Graphs With No Induced 4‐Cycles. Journal of Graph Theory. 2026;112(2):62-95. doi:10.1002/jgt.70013
BibTeX
@article{Henning2026,
author = {Henning, Michael A. and Yeo, Anders},
title = {Domination in 4‐Regular Graphs With No Induced 4‐Cycles},
journal = {Journal of Graph Theory},
year = {2026},
volume = {112},
number = {2},
pages = {62--95},
doi = {10.1002/jgt.70013}
}
EUVIMED