Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings

DOI10.1007/978-3-319-59250-3_35zbMath1418.90277arXiv1708.00582OpenAlexW2618794602MaRDI QIDQ2401181

Kenjiro Takazawa

Publication date: 31 August 2017

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (6)

Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles ⋮ Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Unnamed Item ⋮ A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges ⋮ Complexity of packing common bases in matroids ⋮ Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles

This page was built for publication: Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings