Abstract
We present a min-max formula and a polynomial time algorithm for a slight generalization of the following problem: in a simple undirected graph in which the degree of each node is at most t+1, find a maximum t-matching containing no member of a list of forbidden Kt,t and Kt+1 subgraphs. An analogous problem for bipartite graphs without degree bounds was solved by Makai [15], while the special case of finding a maximum square-free 2-matching in a subcubic graph was solved in [1]. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Bérczi, K., & Végh, L. A. (2010). Restricted b-matchings in degree-bounded graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6080 LNCS, pp. 43–56). https://doi.org/10.1007/978-3-642-13036-6_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
