The following pages link to Matching theory (Q3395507):
Displaying 47 items.
- The random fractional matching problem (Q4964595) (← links)
- A Pfaffian formula for matching polynomials of outerplanar graphs (Q4999332) (← links)
- Cross-ratio degrees and perfect matchings (Q5039229) (← links)
- Harary polynomials (Q5056203) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
- THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH (Q5076247) (← links)
- (Q5090466) (← links)
- Pairwise Preferences in the Stable Marriage Problem (Q5090469) (← links)
- (Q5090495) (← links)
- CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS (Q5102213) (← links)
- Parameterized Algorithms and Kernels for Rainbow Matching (Q5111288) (← links)
- A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs (Q5128500) (← links)
- Random-link matching problems on random regular graphs (Q5135089) (← links)
- Adaptive Structure Concept Factorization for Multiview Clustering (Q5157163) (← links)
- (Q5212269) (← links)
- Approximating real-rooted and stable polynomials, with combinatorial applications (Q5216314) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Editing to Connected F-Degree Graph (Q5232130) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- (Q5743485) (← links)
- The Dyck bound in the concave 1-dimensional random assignment model (Q5870421) (← links)
- Some remarks about acyclic and tridiagonal Birkhoff polytopes (Q5962839) (← links)
- Hopf Monoids and Generalized Permutahedra (Q6051923) (← links)
- Perfect matchings and derangements on graphs (Q6055945) (← links)
- Connected cubic graphs with the maximum number of perfect matchings (Q6057662) (← links)
- Complementability of isometric copies of \(\ell_1\) in transportation cost spaces (Q6062995) (← links)
- Diverse Pairs of Matchings (Q6065425) (← links)
- On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
- Solving the edge‐disjoint paths problem using a two‐stage method (Q6066718) (← links)
- (Q6070584) (← links)
- Color‐biased Hamilton cycles in random graphs (Q6074685) (← links)
- Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph (Q6094709) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)
- Dimers, webs, and local systems (Q6138023) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)
- Dual semi-supervised convex nonnegative matrix factorization for data representation (Q6149524) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- The greatest values for atom-bond sum-connectivity index of graphs with given parameters (Q6180579) (← links)
- Some new results on the prime order Cayley graph of given groups (Q6187589) (← links)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs (Q6197704) (← links)
- Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
- How I got to like graph polynomials (Q6593617) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
- Spanning trees in graphs without large bipartite holes (Q6632805) (← links)
- On a Norine-Thomas conjecture concerning minimal bricks (Q6642520) (← links)
