Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)

DOI10.1007/978-3-540-72792-7_4zbMath1136.90454OpenAlexW2145478238MaRDI QIDQ5429256

Yanjun Li, David B. Hartvigsen

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_4

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs ⋮ An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs

This page was built for publication: Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)