Matching theory
From MaRDI portal
Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Recommendations
Cited in
(only showing first 100 items - show all)- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- 1.61-approximation for min-power strong connectivity with two power levels
- Global forcing number for maximal matchings
- The average size of matchings in graphs
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- Induced matchings in subcubic graphs without short cycles
- Matchings in graphs of odd regularity and girth
- The computational complexity of antimatroid properties
- Star-uniform graphs
- 35/44-approximation for asymmetric maximum TSP with triangle inequality
- Block triangularization of skew-symmetric matrices
- A characterization of König-Egerváry graphs using a common property of all maximum matchings
- The delta-sum of matching delta-matroids
- Supermodularity in unweighted graph optimization. III: Highly connected digraphs
- A wheels-and-whirls theorem for 3-connected 2-polymatroids
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
- On the general degree-eccentricity index of a graph
- Kekulé structures of honeycomb lattice on Klein bottle and Möbius strip
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
- Bayesian locally optimal design of knockout tournaments
- Geometry of the space of phylogenetic trees
- Bounds on the largest root of the matching polynomial
- Toughness in graphs -- a survey
- Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage
- Scheduling time-constrained multicast messages in circuit-switched tree networks.
- Exploring uses of persistent homology for statistical analysis of landmark-based shape data
- Degree of indecomposability of certain highly regular zero-one matrices
- Spectra of weighted uniform hypertrees
- The generalized popular condensation problem
- Graphs with each edge in at most one maximum matching
- Removable edges in Halin graphs
- scientific article; zbMATH DE number 4114689 (Why is no real title available?)
- On maximum matchings in 5-regular and 6-regular multigraphs
- Extensions of barrier sets to nonzero roots of the matching polynomial
- Conjectures of TxGraffiti: independence, domination, and matchings
- On two unsolved problems concerning matching covered graphs
- Optimizing the marriage market: an application of the linear assignment model
- On the size of 3-uniform linear hypergraphs
- Matching Theory and Economic Model Building
- Altruistically unbalanced kidney exchange
- Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors
- On two conjectures concerning total domination subdivision number in graphs
- Positive semidefinite zero forcing numbers of two classes of graphs
- When is \(G^2\) a König-Egerváry graph?
- Factor-critical graphs with the minimum number of near-perfect matchings
- Analysis of multi-stage open shop processing systems
- On complementary coverage of \({\Omega}_n(T)\)
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- Cell rotation graphs of strongly connected orientations of plane graphs with an application
- The covering radius of the cycle code of a graph
- A comparison of two edge-coloring formulations
- Generalized \(D\)-graphs for nonzero roots of the matching polynomial
- The even and odd cut polytopes
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
- Approximating bounded-degree spanning trees and connected factors with leaves
- Factors of claw-free graphs
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Indecomposable regular graphs and hypergraphs
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Fast algorithms for the undirected negative cost cycle detection problem
- Approximation algorithms for connected graph factors of minimum weight
- 1-factor covers of regular graphs
- A submodular optimization problem with side constraints
- Equistarable bipartite graphs
- A lower bound on the number of removable ears of 1-extendable graphs
- The graph of perfect matching polytope and an extreme problem
- Sets of elements that pairwise generate a linear group
- Minimal cost reconfiguration of data placement in a storage area network
- Nice pairs of disjoint pentagons in fullerene graphs
- Nice pairs of odd cycles in fullerene graphs
- Packing stars in fullerenes
- A (2 + ) k-vertex kernel for the dual coloring problem
- Transversals and independence in linear hypergraphs with maximum degree two
- Optimal matchings in posets
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- Forcing faces in plane bipartite graphs
- Independence number in n-extendable graphs
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- Exact solution of the 2d dimer model: corner free energy, correlation functions and combinatorics
- Models and complexity of multibin packing problems
- Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
- Critical paired dominating sets and irreducible decompositions of powers of edge ideals
- Skeleton matching polytope: realization and isomorphism
- The train frequency compatibility problem
- A characterization of nonfeasible sets in matching covered graphs
- On the dimer problem of the vertex-edge graph of a cubic graph
- On disjoint matchings in cubic graphs
- Fractal Dimensions and Random Transformations
- Capacities of graphs and \(2\)-matchings
- Complete Forcing Numbers of Polyphenyl Systems
- Matchability and \(k\)-maximal matchings
- 4-edge-coloring graphs of maximum degree 3 in linear time
- A note on the cyclical edge-connectivity of fullerene graphs
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- Finding all maximally-matchable edges in a bipartite graph
- Skew-adjacency matrices of graphs
- On restricted \(r\)-Stirling numbers, also known as \(r\)-Bessel numbers
- On edge-disjoint pairs of matchings
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
This page was built for publication: Matching theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088987)
