TRIANGLE-FREE 2-MATCHINGS REVISITED

DOI10.1142/S1793830910000930zbMath1216.05109MaRDI QIDQ3084696

Alexey Gusakov, Ilya Razenshteyn, Maxim A. Babenko

Publication date: 25 March 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

regular graphsgraph algorithmstriangle-free 2-matchings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A fast scaling algorithm for the weighted triangle-free 2-matching problem ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ Faster algorithms for half-integral T -Path packing

Cites Work

• Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Perfect triangle-free 2-matchings
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item

This page was built for publication: TRIANGLE-FREE 2-MATCHINGS REVISITED