Colloquium for October 14, 2008
| View Other Colloquia |
| Maximally Non-Matching Covered Graphs |
| Dr. Kimberly J. Burch <kjburch@iup.edu >, Indiana University of Pennsylvania Timothy Muller <T.B.Muller@iup.edu>, Indiana University of Pennsylvania |
| Tuesday October 14, 2008, 3:30 pm to 4:30 pm |
| Stright 302 |
Sponsored by Mathematics Department |
Description:
| Let G be a graph. G is said to be matching covered if for every edge e in G, there exists a perfect matching containing e. Infinite families of matching covered graphs are presented and proven. Let graphs be defined as "maximally non-matching covered" if they have only one edge not contained in any perfect matching. Conditions for which graphs are maximally non-matching covered are investigated and preliminary results are presented. |
Contact Channa Navaratna <channa@iup.edu>, 724-357-4762, for more information.
| Display as a Poster | ||
| View Other Colloquia |