Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Chappell, Glenn G."'
Autor:
Chappell, Glenn G.
For positive integers $a$ and $b$, a graph $G$ is $(a:b)$-choosable if, for each assignment of lists of $a$ colors to the vertices of $G,$ each vertex can be colored with a set of $b$ colors from its list so that adjacent vertices are colored with di
Externí odkaz:
http://arxiv.org/abs/2205.09856
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 the vertices from {0, 1} so that the sum over each closed neighborhoo
Externí odkaz:
http://arxiv.org/abs/1701.05961
Autor:
Berman, Leah Wrenn, Chappell, Glenn G., Faudree, Jill R., Gimbel, John, Hartman, Chris, Williams, Gordon I.
An \emph{obstacle representation} of a graph $G$ is a straight-line drawing of $G$ in the plane together with a collection of connected subsets of the plane, called \emph{obstacles}, that block all non-edges of $G$ while not blocking any of the edges
Externí odkaz:
http://arxiv.org/abs/1606.03782
Autor:
Chappell, Glenn G.
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 and Kleitman proved that, for each k, every finite poset has a simultane
Externí odkaz:
http://arxiv.org/abs/math/9807175
Autor:
Chappell, Glenn G.
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 two in the same row or column. We generalize this to matrices with entri
Externí odkaz:
http://arxiv.org/abs/math/9807036
Autor:
Chappell, Glenn G.
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 difference lies in D. We investigate the chromatic numbers of distance graphs.
Externí odkaz:
http://arxiv.org/abs/math/9805084
Autor:
Chappell, Glenn G.
Let G be an n-vertex graph with list-chromatic number $\chi_\ell$. Suppose each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas conjecture that at least $t n / {\chi_\ell}$ vertices can be colored from these lists. We prove
Externí odkaz:
http://arxiv.org/abs/math/9805066
Autor:
Michael, T. S., Wardlaw, William P., Grossman, Jerrold W., Gulicher, Herbert, Gilbert, George T., Chappell, Glenn G., Sheeran, Frank, Tamvakis, Harry, Morris, Howard Cary, Agnew, Robert A., Bencze, Mihaly, Foss, Matt, Galperin, Gregory, Gauchman, Hillel, Falkowitz, Mordechai, Woo, Peter Y., McGarry, Vince, Pfiefer, Richard E., Boase, Mansur, Solvers, TAMUK Problem
Publikováno v:
Mathematics Magazine, 1999 Oct 01. 72(4), 325-331.
Externí odkaz:
https://www.jstor.org/stable/2691234
Autor:
Chappell, Glenn G., Chapman, Robin
Publikováno v:
The American Mathematical Monthly, 2000 Oct 01. 107(8), 756-756.
Externí odkaz:
https://www.jstor.org/stable/2695487