Abstract
In this note we will derive some structural results for a bipartite graph G with a unique f-factor. Two necessary conditions will be that G is saturated, meaning that the addition of any edge leads to a second f-factor, and that f A , f B ≥1. Here f A and f B are defined as the minimum of f over the vertices in the two partite sets A and B of G, respectively. Our main result states that G has at least f A + f B vertices for which d G (v) = f(v) holds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chartrand, G., Lesniak, L.: Graphs and Digraphs 3rd edition. Chapman and Hall, London 1996
Hoffmann, A., Sidorowicz, E., Volkmann, L.: Extremal bipartite graphs with a unique k-factor, submitted
Jackson, B., Whitty, R.W.: A note concerning graphs with unique f-factors. J. Graph Theory 9 577–580 (1989)
Johann, P., On the structure of graphs with a unique k-factor. J. Graph Theory 35 227–243 (2000)
Volkmann, L.: The maximum size of graphs with a unique k-factor. Combinatorica 24 531–540 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hoffmann, A., Volkmann, L. Structural Remarks on Bipartite Graphs with Unique f-Factors. Graphs and Combinatorics 21, 421–425 (2005). https://doi.org/10.1007/s00373-005-0631-2
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-005-0631-2