1 citations · 1 across the 3 of their papers we have counts for
6 papers · 1 filter
Toughness of recursively partitionable graphs
Calum Buchanan, Brandon Du Preez, K. E. Perry +1
A simple graph on vertices is said to be recursively partitionable (RP) if , or if is connected and satisfies the following recursive property: for…
Symmetry Parameters for Mycielskian Graphs
Debra Boutin, Sally Cockburn, Lauren Keough +3
The Mycielskian construction, denoted , takes a finite simple graph to a larger graph with of the same clique number but larger chromatic number. The generalized Mycielsk…
An Extremal Problem on Rainbow Spanning Trees in Graphs
Matthew DeVilbiss, Bradley Fain, Amber Holmes +3
A spanning tree of an edge-colored graph is rainbow provided that each of its edges receives a distinct color. In this paper we consider the natural extremal problem of maximizing…
Distinguishing Generalized Mycielskian Graphs
Debra Boutin, Sally Cockburn, Lauren Keough +3
A graph is -distinguishable if there is a coloring of the vertices with colors so that only the trivial automorphism preserves the color classes. The smallest such i…
Antimagic orientations of graphs with large maximum degree
Donglei Yang, Joshua Carlson, Andrew Owens +5
Given a digraph with arcs, a bijection is an antimagic labeling of if no two vertices in have the same vertex-sum, where t…
Optimizing the trade-off between number of cops and capture time in Cops and Robbers
Anthony Bonato, Jane Breen, Boris Brimkov +6
The cop throttling number of a graph for the game of Cops and Robbers is the minimum of , where is the number of cops and is the minimu…