The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.
citing papers explorer
-
The Normal Domination Partizan Game in Stars
The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
-
Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)
This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.