17 citations · 18 across the 6 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2025
Connected equitably -colorable realizations with -factors
James M. Shook
A graph is said to be equitably -colorable if its vertices can be partitioned into independent sets that pairwise differ in size by at most one. Chen, Lih, and Wu conjec…
math.CO2023
Packing a Degree Sequence Realization With A Graph
James M. Shook
Two simple -vertex graphs and , with respective maximum degrees and , are said to pack if is isomorphic to a subgraph of the complement of…
math.CO2022
a characterization of the centers of chordal graphs
James M Shook, Bing Wei
A graph is -chordal if it does not have an induced cycle with length greater than . We call a graph chordal if it is -chordal. Let be a graph. The distance between the…