12 citations · 39 across the 10 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…
On the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs
Keivan Hassani Monfared, Paul Horn, Franklin H. J. Kenter +3
The principal permanent rank characteristic sequence is a binary sequence where if there exists a principal square submatrix of size with nonzero…
Links between orthogonal arrays, association schemes and partial geometric designs
Kathleen Nowak, Oktay Olmez, Sung Y. Song
In this paper, we show how certain three-class association schemes and orthogonal arrays give rise to partial geometric designs. We also investigate the connections between partial…