Stuart M. Allen
Abstract
Abstract We prove a necessary and sufficient condition for a regular bipartite multigraph to contain a 1‐factor including one specified set of independent edges and avoiding another specified set of edges. © 1995 John Wiley & Sons, Inc.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract We prove a necessary and sufficient condition for a regular bipartite multigraph to contain a 1‐factor including one specified set of independent edges and avoiding another specified set of edges. © 1995 John Wiley & Sons, Inc.
Key concepts: Multigraph, Bipartite graph, Combinatorics, Mathematics, Set (abstract data type), Discrete mathematics, Computer science, Graph