A matching problem with side conditions
From MaRDI portal
Cites work
- Adjacent vertices on the b-matching polyhedron
- Edmonds polytopes and weakly hamiltonian graphs
- Establishing the matching polytope
- Graph Theory and Integer Programming
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- Local Unimodularity in the Matching Polytope
- Maximum matching and a polyhedron with 0,1-vertices
- The Factors of Graphs
Cited in
(39)- Weighted restricted 2-matching
- Approximating the maximum 3-edge-colorable subgraph problem
- Minimal 2-matching-covered graphs
- Packings by cliques and by finite families of graphs
- Generalized partitions of graphs
- A greedy heuristic for a minimum-weight forest problem
- A fast scaling algorithm for the weighted triangle-free 2-matching problem
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Approximating minimum-cost graph problems with spanning tree edges
- Polyhedron of triangle-free simple 2-matchings in subcubic 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
- Matchings of cycles and paths in directed graphs
- Finding maximum square-free 2-matchings in bipartite graphs
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
- Packings by Complete Bipartite Graphs
- Triangle-free 2-matchings and M-concave functions on jump systems
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- Path factors of bipartite graphs
- 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
- An algorithm for finding a maximum t-matching excluding complete partite subgraphs
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- Approximation Algorithms for a Network Design Problem
- Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
- scientific article; zbMATH DE number 2230217 (Why is no real title available?)
- Finding triangle-free 2-factors in general graphs
- Easy and hard separation of sparse and dense odd-set constraints in matching
- On sign-invertible graphs
- An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover
- Finding a maximum restricted t-matching via Boolean edge-CSP
- Finding a maximum restricted \(t\)-matching via Boolean edge-CSP
- On the complexity of finding central configurations of the graph-generalized ( n^2 - 1 )-puzzle
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- \((p,k)\)-coloring problems in line graphs
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
This page was built for publication: A matching problem with side conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145707)
