The following pages link to Matching theory (Q1088987):
Displaying 50 items.
- Faces of Birkhoff Polytopes (Q161295) (← links)
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- König graphs for 3-paths and 3-cycles (Q266789) (← links)
- A maximum resonant set of polyomino graphs (Q274682) (← links)
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- Equistarable bipartite graphs (Q279223) (← links)
- On the skew-permanental polynomials of orientation graphs (Q284839) (← links)
- Matching preclusion for vertex-transitive networks (Q290107) (← links)
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Packing non-zero \(A\)-paths via matroid matching (Q317424) (← links)
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- Computing an evolutionary ordering is hard (Q324805) (← links)
- A strengthened general cut-generating procedure for the stable set polytope (Q324806) (← links)
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- Complete forcing numbers of primitive coronoids (Q328729) (← links)
- Fast algorithm to find 2-factor of minimum weight (Q334255) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- A recurrent algorithm to solve the weighted matching problem (Q341372) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Graph invertibility and median eigenvalues (Q344913) (← links)
- Large chromatic number and Ramsey graphs (Q367059) (← links)
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- A study of monopolies in graphs (Q367095) (← links)
- Pfaffian graphs embedding on the torus (Q382787) (← links)
- Enumerating perfect matchings in \(n\)-cubes (Q382880) (← links)
- Forbidden induced subgraphs for near perfect matchings (Q385401) (← links)
- On the cores of games arising from integer edge covering functions of graphs (Q386434) (← links)
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- Generalizing Tutte's theorem and maximal non-matchable graphs (Q390291) (← links)
- Average connectivity and average edge-connectivity in graphs (Q390306) (← links)
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions (Q390921) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Matchings in graphs of odd regularity and girth (Q394288) (← links)
- On maximum matchings in almost regular graphs (Q394310) (← links)
- On the size of 3-uniform linear hypergraphs (Q396731) (← links)
- Rainbow numbers for matchings in plane triangulations (Q397167) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Altruistically unbalanced kidney exchange (Q403725) (← links)
- Matching covered graphs with three removable classes (Q405203) (← links)
- The number of maximum matchings in a tree (Q409365) (← links)
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph (Q417494) (← links)
- Skew-adjacency matrices of graphs (Q417551) (← links)
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
