<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>QSpace Collection:</title>
    <link>http://hdl.handle.net/1974/5942</link>
    <description />
    <pubDate>Wed, 22 May 2013 05:21:16 GMT</pubDate>
    <dc:date>2013-05-22T05:21:16Z</dc:date>
    <image>
      <title>The Channel Image</title>
      <url>http://qspace.library.queensu.ca:80/retrieve/23698/KayakS.jpg</url>
      <link>http://hdl.handle.net/1974/5942</link>
    </image>
    <item>
      <title>Hall conditions for edge-weighted bipartite graphs</title>
      <link>http://hdl.handle.net/1974/5946</link>
      <description>Title: Hall conditions for edge-weighted bipartite graphs
Authors: Gregory, David
Abstract: A weighted variant of Hall's condition for the existence of matchings is shown to&#xD;
be equivalent to the existence of a matching in a lexicographic product.&#xD;
This is used to introduce characterizations of those bipartite graphs whose edges may be replicated so as to yield semiregular multigraphs or, equivalently, semiregular edge-weightings.  Such bipartite graphs will be called semiregularizable.&#xD;
Some infinite families of semiregularizable trees are described and all semiregularizable trees on at most 11 vertices are listed.&#xD;
Matrix analogues of some of the results are mentioned and are shown to imply some of the known characterizations of regularizable graphs.
Description: Notes based on seminar talks given at Queen's University and the Royal Military College, Kingston, 2009-10.</description>
      <pubDate>Wed, 28 Jul 2010 14:50:18 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/1974/5946</guid>
      <dc:date>2010-07-28T14:50:18Z</dc:date>
    </item>
  </channel>
</rss>

