Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-26T15:32:19.830Z Has data issue: false hasContentIssue false
  • English
  • Français

MATCHINGS INCLUDING OR EXCLUDING CERTAIN EDGE SETS IN BIPARTITE GRAPHS

Published online by Cambridge University Press:  01 May 1997

HOLLIE L. BUCHANAN II
HOLLIE L. BUCHANAN II
Affiliation:
Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA
Get access

Abstract

Necessary and sufficient conditions are obtained for a bipartite graph to admit a matching which includes a preassigned set of edges and excludes another preassigned set of edges.

Type
Research Article
Information
Bulletin of the London Mathematical Society , Volume 29 , Issue 3 , May 1997 , pp. 303 - 306
Copyright
© The London Mathematical Society 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)