Maximum cardinality 1-restricted simple 2-matchings

zbMath1158.05332MaRDI QIDQ1010633

David B. Hartvigsen

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129717

zbMATH Keywords

Hamilton cycle1-restricted 2-matchingsmin max theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Faster algorithm for finding maximum 1-restricted simple 2-matchings ⋮ Faster algorithm for finding maximum 1-restricted simple 2-matchings ⋮ A note on \({\mathtt V}\)-free 2-matchings ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems

This page was built for publication: Maximum cardinality 1-restricted simple 2-matchings