3 citations · 3 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Winding number and circular 4-coloring of signed graphs
Anna Gujgiczer, Reza Naserasr, Rohini S +1
Concerning the recent notion of circular chromatic number of signed graphs, for each given integer we introduce two signed bipartite graphs, each on vertices, having…
math.CO2023
Complexity of Near-3-Choosability Problem
Sounaka Mishra, Rohini S, Sagar S. Sawant
It is currently an unsolved problem to determine whether a -free planar graph contains an independent set such that is -choosable. However…