Bérczi, Kristóf and Végh, László A. 
ORCID: 0000-0003-1152-200X
(2010)
Restricted b-matchings in degree-bounded graphs.
In: The 14th Conference on Integer Programming & Combinatorial Optimization (IPCO XIV), 2010-06-09 - 2010-06-11, Lausanne, Switzerland.
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 K t,t and K t + 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].
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Official URL: | http://ipco.epfl.ch/index.html#start |
| Additional Information: | © 2010 The Authors |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Date Deposited: | 11 Oct 2012 12:36 |
| Last Modified: | 29 Mar 2024 05:03 |
| URI: | http://eprints.lse.ac.uk/id/eprint/45896 |
Actions (login required)
 |
View Item |
