The 3/5-conjecture for weakly $S(K_{1, 3})$-free forests (Q2629288): Difference between revisions

@@ Property / cites work @@
+Domination game: effect of edge- and vertex-removal
+Normal rank
@@ Property / cites work @@
+Domination game: extremal families of graphs for \(3/5\)-conjectures
+Normal rank
@@ Property / cites work @@
+Domination Game and an Imagination Strategy
@@ Property / cites work: Domination Game and an Imagination Strategy / rank @@
+Normal rank
@@ Property / cites work @@
+Domination game played on trees and spanning subgraphs
+Normal rank
@@ Property / cites work @@
+On the game domination number of graphs with given minimum degree
+Normal rank
@@ Property / cites work @@
+Domination game on forests
@@ Property / cites work: Domination game on forests / rank @@
+Normal rank
@@ Property / cites work @@
+The domination game played on unions of graphs
@@ Property / cites work: The domination game played on unions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
+Normal rank
@@ Property / cites work @@
+Total version of the domination game
@@ Property / cites work: Total version of the domination game / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal Problems for Game Domination Number
@@ Property / cites work: Extremal Problems for Game Domination Number / rank @@
+Normal rank
@@ Property / cites work @@
+Realizations of the game domination number
@@ Property / cites work: Realizations of the game domination number / rank @@
+Normal rank
@@ Property / cites work @@
+Characterisation of forests with trivial game domination numbers
+Normal rank

The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests (Q2629288): Difference between revisions

Latest revision as of 06:12, 12 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)