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

DOI10.1007/978-3-540-72792-7_4MaRDI QIDQ5429256zbMATH OpenOpenAlexFDO

Authors Yanjun Li, David 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

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

Recommendations

• Polyhedron of triangle-free simple 2-matchings in subcubic graphs
• A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
• Maximum Cardinality Simple 2-matchings in Subcubic Graphs
• Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
• Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles

Cited in

(10)

• Polyhedron of triangle-free simple 2-matchings in subcubic graphs
• A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
• Maximum Cardinality Simple 2-matchings in Subcubic Graphs
• Polyhedral Results for 1-Restricted Simple 2-Matchings
• Triangle-free 2-matchings and M-concave functions on jump systems
• 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
• Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
• Integer Programming and Combinatorial Optimization
• A PTAS for weighted triangle-free 2-matching

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

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