Tuesday, June 13
CP5
Matchings and Coverings
10:30 am - 12:30 pm
Room: Section C
Chair: To be determined
- 10:30 - 10:45 Star Forests and Dominating Sets
- Ruth Haas, Smith College, USA; Denis Hanson, University of Regina, Canada; and Shelia Ferneyhough and Gary MacGillivray, University of Victoria, Canada
- 10:50 - 11:05 On Nearly Perfect Matching of Hypergraphs: Codegrees of Higher Orders Do Help
- Van H. Vu, Microsoft Research, USA
- 11:10 - 11:25 A Tree Version Of Konig's Theorem
- Ron Aharoni, Technion, Israel; Eli Berger, IBM Research Center, Israel; and Ran Ziv, Tel-Hai Academic College, Israel
- 11:30 - 11:45 On alpha Critical Edges in König-Egerváry Graphs
- Vadim E. Levit and Eugen Mandrescu, Holon Academic Institute of Technology, Israel
- 11:50 - 12:05 A Characterisation of Pfaffian Near Bipartite Graphs
- Ilse Fischer, Universität Klagenfurt, Austria; and Charles H.C. Little, Massey University, New Zealand