Zhouningxin Wang

most citedMapping sparse signed graphs to

(K_{2 k}, M)

3 citations · 4 across the 2 of their papers we have counts for

collaborators

4 papers

math.CO2021

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 $0$ -free coloring of signed gra…

math.CO2021★ 1 cited

Circular $(4 - ε)$ -coloring of some classes of signed graphs

František Kardoš, Jonathan Narboni, Reza Naserasr +1

A circular $r$ -coloring of a signed graph $(G, σ)$ is an assignment $ϕ$ of points of a circle $C_{r}$ of circumference $r$ to the vertices of $(G, σ)$ such that for each positive edg…

math.CO2021★ 3 cited

Mapping sparse signed graphs to $(K_{2 k}, M)$

Reza Naserasr, Riste Škrekovski, Zhouningxin Wang +1

A homomorphism of a signed graph $(G, σ)$ to $(H, π)$ is a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ such that adjacencies, incidences and th…

math.CO2020

Circular chromatic number of signed graphs

Reza Naserasr, Zhouningxin Wang, Xuding Zhu

A signed graph is a pair $(G, σ)$ , where $G$ is a graph and $σ : E (G) \to {+, -}$ is a signature which assigns to each edge of $G$ a sign. Various notions of coloring of signed gr…

Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem

Circular (4−ε)-coloring of some classes of signed graphs

Mapping sparse signed graphs to (K2k​,M)

Circular chromatic number of signed graphs

Circular $(4 - ε)$ -coloring of some classes of signed graphs

Mapping sparse signed graphs to $(K_{2 k}, M)$