1 citations · 1 across the 9 of their papers we have counts for
10 papers · 1 filter
Frustration index of a signed planar graph and the feedback vertex set
Sirui Chen, Jiaao Li, Zhouningxin Wang
A feedback vertex set of a graph is a set of vertices whose deletion leaves a forest. In 2016, Dross, Montassier, and Pinlou conjectured that every planar graph of girth at lea…
Reconfiguration of Nowhere-zero Flows
Daniel W. Cranston, Jiaao Li, Bo Su +2
Fix an abelian group , a graph , and nowhere-zero -flows and on . Now and are \emph{-flow-adjacent} if there exists a cycle in such tha…
Characterization of strongly -connected graphs of small order
Jiaao Li, Bo Su, Zhouningxin Wang +1
A graph is strongly -connected if for each boundary function with for every vertex and $\sum_{v \in V(G)} β(v)…
Orientations of -Edge-Connected Planar Multigraphs and Applications
Daniel W. Cranston, Jiaao Li, Bo Su +2
A graph is called strongly -connected if for each boundary function with , there exists an orientatio…
Frustration indices of signed subcubic graphs
Sirui Chen, Jiaao Li, Zhouningxin Wang
The frustration index of a signed graph is defined as the minimum number of negative edges among all switching-equivalent signatures. This can be regarded as a generalization of th…
Fractional balanced chromatic number of signed subcubic graphs
Xiaolan Hu, Luis Kuffner, Jiaao Li +4
A signed graph is a pair , where is a graph and , called signature, is an assignment of signs to the edges. Given a signed graph wit…
Planar Graphs with Homomorphisms to the 9-cycle
Daniel W. Cranston, Jiaao Li, Zhouningxin Wang +1
We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at lea…
Circular flows in mono-directed signed graphs
Jiaao Li, Reza Naserasr, Zhouningxin Wang +1
In this paper the concept of circular -flows in a mono-directed signed graph is introduced. That is a pair , where is an orientation on and $f: E(G)\to…
Circular Coloring and Fractional Coloring in Planar Graphs
Xiaolan Hu, Jiaao Li
We study the following Steinberg-type problem on circular coloring: for an odd integer , what is the smallest number such that every planar graph of girth withou…
Circular Flows in Planar Graphs
Daniel W. Cranston, Jiaao Li
For integers , a \emph{circular -flow} is a flow that takes values from . The Planar Circular Flow Conjecture states that ever…