27 citations · 87 across the 27 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
A lower bound on the saturation number, and graphs for which it is sharp
Alex Cameron, Gregory J. Puleo
Let be a fixed graph. We say that a graph is -saturated if it has no subgraph isomorphic to , but the addition of any edge to results in an -subgraph. The satu…
math.CO2020
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…