3 citations · 4 across the 3 of their papers we have counts for
9 papers
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem
Reza Naserasr, Zhouningxin Wang
The notion of the circular coloring of signed graphs is a recent one that simultaneously extends both notions of the circular coloring of graphs and -free coloring of signed gra…
Circular -coloring of some classes of signed graphs
František Kardoš, Jonathan Narboni, Reza Naserasr +1
A circular -coloring of a signed graph is an assignment of points of a circle of circumference to the vertices of such that for each positive edg…
Mapping sparse signed graphs to
Reza Naserasr, Riste Škrekovski, Zhouningxin Wang +1
A homomorphism of a signed graph to is a mapping of vertices and edges of to (respectively) vertices and edges of such that adjacencies, incidences and th…
Circular chromatic number of signed graphs
Reza Naserasr, Zhouningxin Wang, Xuding Zhu
A signed graph is a pair , where is a graph and is a signature which assigns to each edge of a sign. Various notions of coloring of signed gr…
Extension of Gyarfas-Sumner conjecture to digraphs
Pierre Aboulker, Pierre Charbit, Reza Naserasr
The dichromatic number of a digraph is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph. As it generaliz…
Exact square coloring of subcubic planar graphs
Florent Foucaud, Hervé Hocquard, Suchismita Mishra +4
We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 rec…