9 citations · 16 across the 6 of their papers we have counts for
7 papers
List Multicoloring of Planar Graphs and Related Classes
Glenn G. Chappell
For positive integers and , a graph is -choosable if, for each assignment of lists of colors to the vertices of each vertex can be colored with a set of…
Approximations of the domination number of a graph
Glenn G. Chappell, John Gimbel, Chris Hartman
Given a graph G, the domination number gamma(G) of G is the minimum order of a set S of vertices such that each vertex not in S is adjacent to some vertex in S. Equivalently, label…
Graphs with obstacle number greater than one
Leah Wrenn Berman, Glenn G. Chappell, Jill R. Faudree +3
An \emph{obstacle representation} of a graph is a straight-line drawing of in the plane together with a collection of connected subsets of the plane, called \emph{obstacles…
Polyunsaturated Posets and Graphs and the Greene-Kleitman Theorem
Glenn G. Chappell
A partition of a finite poset into chains places a natural upper bound on the size of a union of k antichains. A chain partition is k-saturated if this bound is achieved. Greene an…
A Matroid Generalization of a Result on Row-Latin Rectangles
Glenn G. Chappell
Let A be an m \times n matrix in which the entries of each row are all distinct. Drisko showed that, if m \ge 2n-1, then A has a transversal: a set of n distinct entries with no tw…
Coloring Distance Graphs on the Integers
Glenn G. Chappell
Given a set D of positive integers, the associated distance graph on the integers is the graph with the integers as vertices and an edge between distinct vertices if their differen…