Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Yu, Gexin - Department of Mathematics, College of William and Mary
Extremal graph packing problems: Ore-type versus H. A. Kierstead, A. V. Kostochka, and Gexin Yu
Injective colorings of sparse graphs Daniel W. Cranston
Linear Choosability of Sparse Graphs Daniel W. Cranston
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
INJECTIVE COLORINGS OF GRAPHS WITH LOW AVERAGE DEGREE DANIEL W. CRANSTON
On the pagenumber of k-trees Jennifer Vandenbussche
2009 3 13 1 March, 2009 OR Transactions Vol.13 No.1
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Permutations as Product of Parallel Transpositions Chase Albert
Section 7.7 Deriving the Trapezoidal Rule Error The error bounds for numerical integration are presented without proof. While it is
