𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Domination game: Extremal families of graphs for -conjectures

✍ Scribed by Brešar, Boštjan; Klavžar, Sandi; Košmrlj, Gašper; Rall, Douglas F.

Book ID
122783585
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
438 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal Problems for Game Domination Nu
Extremal Problems for Game Domination Number
✍ Kinnersley, William B.; West, Douglas B.; Zamani, Reza 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 345 KB
Families of graphs complete for the stro
Families of graphs complete for the strong perfect graph Conjecture
✍ D. G. Corneil 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB 👁 1 views

The Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true

Proof of a conjecture on game domination
Proof of a conjecture on game domination
✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume