The following pages link to Perfect matchings of a graph (Q2531805):
Displayed 35 items.
- Graphs associated with vector spaces of even dimension: A link with differential geometry (Q417560) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- On the maximum even factor in weakly symmetric graphs (Q598466) (← links)
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (Q641542) (← links)
- The perfectly matchable subgraph polytope of an arbitrary graph (Q757431) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- On factors with all degrees odd (Q1063044) (← links)
- The two ear theorem on matching-covered graphs (Q1127879) (← links)
- A sufficient condition for a graph to have \([a,b]\)-factors (Q1173656) (← links)
- Neighborhood conditions and edge-disjoint perfect matchings (Q1179275) (← links)
- Binding numbers and \(f\)-factors of graphs (Q1193563) (← links)
- Matchings in graphs. II (Q1214950) (← links)
- The number of 1-factors in 2k-connected graphs (Q1253256) (← links)
- On the graphic matroid parity problem (Q1400959) (← links)
- Computing the binding number of a graph (Q1813976) (← links)
- Triangles and neighbourhoods of independent sets in graphs (Q1850489) (← links)
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs (Q2235291) (← links)
- Matching extendability and connectivity of regular graphs from eigenvalues (Q2303429) (← links)
- The edge-connectivity of strongly 3-walk-regular graphs (Q2303431) (← links)
- Toughness, binding number and restricted matching extension in a graph (Q2401801) (← links)
- Linear hypergraphs with large transversal number and maximum degree two (Q2441629) (← links)
- 1-Faktoren von Graphen. (1-factors of graphs) (Q2551474) (← links)
- Binding number and Hamiltonian (<i>g, f</i>)-factors in graphs II (Q3526044) (← links)
- Factors and factorizations of graphs—a survey (Q3714113) (← links)
- Extremal problems involving neighborhood unions (Q3808117) (← links)
- (Q3875973) (← links)
- A new characterization of the maximum genus of a graph (Q3939829) (← links)
- Über ein graphentheoretisches Ergebnis von T. Gallai (Q4172084) (← links)
- (Q4277394) (← links)
- A sufficient condition for the existence of a <i>k</i>-factor excluding a given <i>r</i>-factor (Q4597678) (← links)
- Sufficient conditions for matchings (Q5661922) (← links)
- The binding number of a graph and its Anderson number (Q5666592) (← links)
- Matchings in graphs (Q5672937) (← links)
- An orientation theorem with parity conditions (Q5954236) (← links)
- Binding number, \(k\)-factor and spectral radius of graphs (Q6197802) (← links)