Triangle-Free 2-Matchings Revisited

DOI10.1007/978-3-642-14031-0_15zbMath1286.05129arXiv1003.2697OpenAlexW2037843992MaRDI QIDQ3578309

Ilya Razenshteyn, Alexey Gusakov, Maxim A. Babenko

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.2697

Mathematics Subject Classification ID

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

Related Items (2)

A model for minimizing active processor time ⋮ A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges

This page was built for publication: Triangle-Free 2-Matchings Revisited