Paired-Domination Game Played in Graphs
From MaRDI portal
Publication:5242939
DOI10.22049/cco.2019.26437.1110zbMath1438.05192OpenAlexW2921304852MaRDI QIDQ5242939
Michael A. Henning, Teresa W. Haynes
Publication date: 8 November 2019
Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_13851_54f7f80cbf84f62b513594201751c9dc.pdf
Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (4)
Cubic graphs have paired-domination number at most four-seventh of their orders ⋮ Paired-domination game played on cycles ⋮ Paired Domination in Graphs ⋮ A proof of a conjecture on the paired-domination subdivision number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The disjoint domination game
- Game total domination for cycles and paths
- Bounds on the game transversal number in hypergraphs
- The domination game played on unions of graphs
- Total version of the domination game
- On-line Ramsey theory for bounded degree graphs
- A new bound on the domination number of graphs with minimum degree two
- Game list colouring of graphs
- The matcher game played in graphs
- The 4/5 upper bound on the game total domination number
- Infinite families of circular and Möbius ladders that are total domination game critical
- On-line Ramsey theory
- Domination game played on trees and spanning subgraphs
- Domination game: effect of edge- and vertex-removal
- Realizations of the game domination number
- Trees with equal total domination and game total domination numbers
- The game total domination problem is log-complete in PSPACE
- Mr. Paint and Mrs. Correct
- Domination game: extremal families of graphs for \(3/5\)-conjectures
- Game matching number of graphs
- Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
- Domination Game and an Imagination Strategy
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
- Domination in graphs with minimum degree two
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Paired-domination in graphs
- Total Domination in Graphs
- Toppling numbers of complete and random graphs
- Extremal Problems for Game Domination Number
This page was built for publication: Paired-Domination Game Played in Graphs
