Triangle-free 2-matchings revisited

M Babenko, A Gusakov… - Discrete Mathematics …, 2010 - World Scientific
… 3 we consider the analogues of Corollary 1.9 with 2-matchings replaced by triangle-free 2-matchings.
We prove that every d-regular graph (d ≥ 3) has a perfect triangle-free 2-matching…

Polyhedron of triangle-free simple 2-matchings in subcubic graphs

D Hartvigsen, Y Li - Mathematical Programming, 2013 - Springer
A simple 2-matching in an edge-weighted graph is a subgraph all of whose nodes have
degree 0, 1 or 2. We consider the problem of finding a maximum weight simple 2-matching that …

Triangle-free simple 2-matchings in subcubic graphs

D Hartvigsen, Y Li - International Conference on Integer Programming and …, 2007 - Springer
… A C3-free 2-matching is also called a triangle-free 2-matching. Let PM (G) denote … of
triangle-free 2matchings in G. Let PF (G) denote the convex hull of incidence vectors of triangle-free

Triangle-free -matchings

K Paluch - arXiv preprint arXiv:2311.13590, 2023 - arxiv.org
… a maximum size triangle-free 2-… 2-matchings, in which every edge e may occur in more
than one copy. Efficient algorithms for triangle-free non-simple 2-matchings (such 2-matchings

[HTML][HTML] A fast scaling algorithm for the weighted triangle-free 2-matching problem

S Artamonov, M Babenko - European Journal of Combinatorics, 2018 - Elsevier
… harder case of simple triangle-free 2-matchings (where x is … For unweighted 2-matchings
(or, equivalently, 1-matchings in … minimum cost among all perfect triangle-free 2-matchings. …

[HTML][HTML] Triangle-free 2-matchings and M-concave functions on jump systems

Y Kobayashi - Discrete Applied Mathematics, 2014 - Elsevier
… Since we consider triangle-free 2-matchings, we may assume that the given graph G is
simple. In what follows in this paper, when we deal with a graph with parallel edges, we call it a …

[HTML][HTML] A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs

Y Kobayashi - Discrete Optimization, 2010 - Elsevier
… the following simple algorithm solves the weighted triangle-free 2-matching problem in
subcubic graphs. Note that since triangle-free 2-matchings contain neither parallel edges nor self-…

Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles

Y Kobayashi - Mathematical Programming, 2022 - Springer
… By imposing restrictions on 2-matchings, various extensions … The relationship between
\(C_{\le k}\)-free 2-matchings and … The case of \(k=3\), which we call the weighted triangle-free 2-…

A fast scaling algorithm for the weighted triangle-free 2-matching problem

S Artamonov, M Babenko - International Workshop on Combinatorial …, 2015 - Springer
… x is called triangle-free. Polyhedrally, triangle-free 2-matchings are harder than 2-matchings,
but … For triangle-free 2-matchings, triangle clusters play the role analogous to that of factor-…

Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles

Y Kobayashi - International Conference on Integer Programming and …, 2020 - Springer
… By imposing restrictions on 2-matchings, various extensions have … Relationship between
\(C_{\le k}\)-free 2-matchings and … The case of \(k=3\), which we call the weighted triangle-free 2-…