Maximum cardinality 1-restricted simple 2-matchings

zbMATH Open1158.05332MaRDI QIDQ1010633FDOQ1010633

Authors: David 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Maximum Cardinality Simple 2-matchings in Subcubic Graphs
• Polyhedral Results for 1-Restricted Simple 2-Matchings
• Finding maximum square-free 2-matchings in bipartite graphs
• Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs

zbMATH Keywords

Hamilton cycle1-restricted 2-matchingsmin max theorem

Mathematics Subject Classification ID

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

Cited In (9)

• Polyhedral Results for 1-Restricted Simple 2-Matchings
• On the maximum 2-1 matching
• Faster algorithm for finding maximum 1-restricted simple 2-matchings
• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
• A note on \({\mathtt V}\)-free 2-matchings
• The nonnegative node weight \(j\)-restricted \(k\)-matching problems
• An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
• Faster algorithm for finding maximum 1-restricted simple 2-matchings
• Maximum Cardinality Simple 2-matchings in Subcubic Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010633)