1.Chapter 8 Independence Section 8.1 Vertex Independence and Coverings Next, we consider a problem that strikes close to home for us all, final exams. At the end of each…
This page intentionally left blank LONDON MATHEMATICAL SOCIETY STUDENT TEXTS Managing editor: Professor C.M. Series, Mathematics Institute University of Warwick, Coventry…
DISCRETE MATHEMATICS ELSEVIER Discrete Mathematics 132 (1994) 231-246 Strongly well-covered graphs* Michael R. Pinter Department of Mathematics, Belmont University, 1900…
A characterization of certain families of well-covered circulant graphs by Rania Moussi A Thesis Submitted to Saint Mary’s University, Halifax, Nova Scotia in Partial Fulfillment…
Slide 1 The Equivalence Number and Transit Graphs for Chessboard Graphs B. Nicholas Wahle Morehead State University Slide 2 Graphs A graph is a set of points called vertices…
Linear-Degree Extractors and the Inapproximability of Max Clique and Chromatic Number David Zuckerman University of Texas at Austin Max Clique and Chromatic Number [FGLSS,…,Hastad]:…
Weakly Connected Domination. Koh Khee Meng Department of Maths National U of Singapore [email protected]. Three Related Dominations. Let G = ( V , E ) be a connected graph.…