Bérczi, Kristóf and Végh, László A. (2010) Restricted b-matchings in degree-bounded graphs. In: The 14th Conference on Integer Programming & Combinatorial Optimization (IPCO XIV), 9th-11th June 2010, Lausanne, Switzerland.
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 , while the special case of finding a maximum square-free 2-matching in a subcubic graph was solved in .
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||© 2010 The Authors|
|Library of Congress subject classification:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Sets:||Departments > Management|
|Identification Number:||Published item via DOI|
|Date Deposited:||11 Oct 2012 12:36|
Actions (login required)
|Record administration - authorised staff only|