James M. Shook

collaborators

3 papers

cs.DS2025

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem

James M. Shook, Isabel Beichl

For a digraph $G$ , a set $F \subseteq V (G)$ is said to be a feedback vertex set (FVS) if $G - F$ is acyclic. The problem of finding a smallest FVS is NP-hard. We present a matrix scal…

math.CO2025

Connected equitably $I^$ -colorable realizations with $k$ -factors

James M. Shook

A graph $G$ is said to be equitably $c$ -colorable if its vertices can be partitioned into $c$ independent sets that pairwise differ in size by at most one. Chen, Lih, and Wu conjec…

math.CO2025

On a conjecture that strengthens Kundu's $k$ -factor Theorem

James M. Shook

Let $I ¨ = (d_{1}, \dots, d_{n})$ be a non-increasing degree sequence with even $n$ . In 1974, Kundu showed that if $D_{k} (I ¨ ) = (d_{1} - k, \dots, d_{n} - k)$ is graphic, then some…

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem

Connected equitably I^-colorable realizations with k-factors

On a conjecture that strengthens Kundu's k-factor Theorem

Connected equitably $I^$ -colorable realizations with $k$ -factors

On a conjecture that strengthens Kundu's $k$ -factor Theorem