4 papers · 1 filter
Compelling Colorings: A generalization of the dominator chromatic number
Anna Bachstein, Wayne Goddard, Michael A. Henning +1
We define a -compelling coloring as a proper coloring of the vertices of a graph such that every subset consisting of one vertex of each color has property . The -compelli…
Graphs in which all maximal bipartite subgraphs have the same order
Wayne Goddard, Kirsti Kuenzel, Eileen Melville
Motivated by the concept of well-covered graphs, we define a graph to be well-bicovered if every vertex-maximal bipartite subgraph has the same order (which we call the bipartite n…
The Generalized Matcher Game
Anna Bachstein, Wayne Goddard, Connor Lehmacher
Recently the matcher game was introduced. In this game, two players create a maximal matching by one player repeatedly choosing a vertex and the other player choosing a conta…
The maximum average connectivity among all orientations of a graph
Rocio M. Casablanca, Peter Dankelmann, Wayne Goddard +2
For distinct vertices and in a graph , the {\em connectivity} between and , denoted , is the maximum number of internally disjoint -- paths in …