Polyhedron of triangle-free simple 2-matchings in subcubic graphs
DOI10.1007/S10107-012-0516-0zbMATH Open1273.05175OpenAlexW2012855576MaRDI QIDQ1949271FDOQ1949271
Authors: Yanjun Li, David Hartvigsen 
Publication date: 6 May 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0516-0
Recommendations
- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
- Triangle-free 2-matchings revisited
- Triangle-free 2-matchings revisited
- Composition of graphs and the triangle free subgraph polytope
- On 2-regular subgraphs in polyhedral graphs
- Composition of graphs and the triangle-free subgraph polytope
- On two-connected subgraph polytopes
- Polyhedral Results for 1-Restricted Simple 2-Matchings
- The perfectly matchable subgraph polytope of an arbitrary graph
traveling salesman problemsubcubic graphpolyhedral characterization2-Matchingsmaximum weight simple 2-matching
Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Title not available (Why is that?)
- The traveling salesman problem in graphs with 3-edge cutsets
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Maximum matching and a polyhedron with 0,1-vertices
- The four-colour theorem
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- Title not available (Why is that?)
- A Short Proof of the Factor Theorem for Finite Graphs
- Edmonds polytopes and weakly hamiltonian graphs
- A matching problem with side conditions
- Finding maximum square-free 2-matchings in bipartite graphs
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs
- Restricted 2-factor polytopes
- On Restricted Two-Factors
- Decomposing 4-Regular Graphs into Triangle-Free 2-Factors
- Title not available (Why is that?)
- Cycles intersecting edge-cuts of prescribed sizes
Cited In (17)
- Polyhedral Results for 1-Restricted Simple 2-Matchings
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- When the Gomory-chvátal closure coincides with the integer hull
- Approximations for the Steiner multicycle problem
- Core index of perfect matching polytope for a 2-connected cubic graph
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- Integer Programming and Combinatorial Optimization
- Finding triangle-free 2-factors in general graphs
- Packing $k$-Matchings and $k$-Critical Graphs
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs
This page was built for publication: Polyhedron of triangle-free simple 2-matchings in subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949271)
