The following pages link to Matching theory (Q3395507):
Displaying 50 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Fast domino tileability (Q312152) (← links)
- Failed skew zero forcing on a graph (Q314747) (← links)
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- A two-stage decomposition of high school timetabling applied to cases in Denmark (Q336881) (← links)
- Matchings on infinite graphs (Q377529) (← links)
- The complexity of generalized domino tilings (Q396923) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- On the maximum number of edges in a hypergraph with a unique perfect matching (Q409380) (← links)
- On the size and structure of graphs with a constant number of 1-factors (Q418889) (← links)
- Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs (Q449212) (← links)
- Growth rates of geometric grid classes of permutations (Q490266) (← links)
- Subset matching and edge coloring in bipartite graphs (Q510962) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- A robust and efficient method for solving point distance problems by homotopy (Q526832) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Rigidity of spherical codes (Q658415) (← links)
- Efficient index reduction algorithm for large scale systems of differential algebraic equations (Q671058) (← links)
- Perfect matching and polymatroids (Q681726) (← links)
- All binomial identities are orderable (Q730270) (← links)
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- Signed analogue of general Kotzig-Lovász decomposition (Q777362) (← links)
- Approximation algorithms for orthogonal line centers (Q831691) (← links)
- Domination game critical graphs (Q891326) (← links)
- Social organizations and matching theory (Q1100121) (← links)
- Constant factor approximation for the weighted partial degree bounded edge packing problem (Q1631679) (← links)
- Robust subspace segmentation via nonconvex low rank representation (Q1671711) (← links)
- Subspace learning for unsupervised feature selection via matrix factorization (Q1677021) (← links)
- Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems (Q1680106) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- Uniform Lie algebras and uniformly colored graphs (Q1707419) (← links)
- Some results on the inverse sum indeg index of a graph (Q1707977) (← links)
- Bivariate chromatic polynomials in computer algebra (Q1733312) (← links)
- Faster and simpler approximation of stable matchings (Q1736612) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Forcing and anti-forcing edges in bipartite graphs (Q1752588) (← links)
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs (Q1782047) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- Geometric conditions for \(\square\)-irreducibility of certain representations of the general linear group over a non-Archimedean local field (Q1989699) (← links)
- Plane elementary bipartite graphs with forcing or anti-forcing edges (Q2000588) (← links)
- Graphs with maximal Hosoya index and minimal Merrifield-Simmons index (Q2017050) (← links)
- Permanental generating functions and sequential importance sampling (Q2020025) (← links)
- A framework of hierarchical attacks to network controllability (Q2025502) (← links)
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181) (← links)
- Random assignment problems on \(2d\) manifolds (Q2034668) (← links)
