10 citations · 27 across the 4 of their papers we have counts for
3 papers · 1 filter
(4,2)-choosability of planar graphs with forbidden structures
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…
Fractional Zero Forcing via Three-color Forcing Games
Leslie Hogben, Kevin F. Palmowski, David E. Roberson +1
An -fold analogue of the positive semidefinite zero forcing process that is carried out on the -blowup of a graph is introduced and used to define the fractional positive sem…
Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
Leslie Hogben, Kevin F. Palmowski, David E. Roberson +1
Fractional minimum positive semidefinite rank is defined from -fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fraction…