4 citations · 9 across the 20 of their papers we have counts for
24 papers
Balanced-chromatic number and Hadwiger-like conjectures
Andrea Jiménez, Jessica McDonald, Reza Naserasr +2
Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward…
Group connectivity of 3-edge-connected signed graphs
Alejandra Brewer Castano, Jessica McDonald, Kathryn Nurse
Jaeger, Linial, Payan, and Tarsi introduced the notion of -connectivity for graphs in 1992, and proved a decomposition for cubic graphs from which -connectivity follows for a…
Another proof of Seymour's 6-flow theorem
Matt DeVos, Jessica McDonald, Kathryn Nurse
In 1981 Seymour proved his famous 6-flow theorem asserting that every 2-edge-connected graph has a nowhere-zero flow in the group (in fact, he…
A Note on the Immersion Number of Generalized Mycielski Graphs
Karen L. Collins, Megan E. Heenehan, Jessica McDonald
The immersion number of a graph , denoted im, is the largest such that has a -immersion. In this note we are interested in determining the immersion number of…
Strong coloring 2-regular graphs: Cycle restrictions and partial colorings
Jessica McDonald, Gregory J. Puleo
Let be a graph with , and let be obtained from by gluing in vertex-disjoint copies of . We prove that if contains at most one odd cycle of length…
On clique immersions in line graphs
Michael Guyer, Jessica McDonald
We prove that if immerses then immerses , where is the graph obtained from by replacing each edge in with a parallel edge of multiplicity…