Perfect matchings of a graph
From MaRDI portal
Cites work
Cited in
(42)- On factors with all degrees odd
- The two ear theorem on matching-covered graphs
- A sufficient condition for a graph to have \([a,b]\)-factors
- Neighborhood conditions and edge-disjoint perfect matchings
- Binding numbers and f-factors of graphs
- Matchings in graphs. II
- The number of 1-factors in 2k-connected graphs
- On the graphic matroid parity problem
- Computing the binding number of a graph
- Triangles and neighbourhoods of independent sets in graphs
- Binding numbers and restricted fractional ( g , f )-factors in graphs
- Matching extendability and connectivity of regular graphs from eigenvalues
- The edge-connectivity of strongly 3-walk-regular graphs
- Toughness, binding number and restricted matching extension in a graph
- Linear hypergraphs with large transversal number and maximum degree two
- 1-Faktoren von Graphen. (1-factors of graphs)
- Binding number and Hamiltonian (g, f)-factors in graphs II
- Factors and factorizations of graphs—a survey
- Extremal problems involving neighborhood unions
- scientific article; zbMATH DE number 3679881 (Why is no real title available?)
- A new characterization of the maximum genus of a graph
- Über ein graphentheoretisches Ergebnis von T. Gallai
- Graphs associated with vector spaces of even dimension: A link with differential geometry
- scientific article; zbMATH DE number 495474 (Why is no real title available?)
- A sufficient condition for the existence of a k-factor excluding a given r-factor
- Best monotone degree conditions for graph properties: a survey
- Sufficient conditions for matchings
- The binding number of a graph and its Anderson number
- Matchings in graphs
- An orientation theorem with parity conditions
- On the maximum even factor in weakly symmetric graphs
- Binding number, \(k\)-factor and spectral radius of graphs
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- Binding number, odd \([1, b]\)-factors and the distance spectral radius
- Tight toughness, isolated toughness and binding number bounds for the \(\{K_2, C_n\}\)-factors
- Bipartite binding number, k-factor and spectral radius of bipartite graphs
- The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph
- Strong binding numbers and factors
- Eigenvalues and factors: a survey
- Sufficient conditions for a graph with minimum degree to be \(k\)-critical with respect to an odd \([1,b]\)-factor
- The perfectly matchable subgraph polytope of an arbitrary graph
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
This page was built for publication: Perfect matchings of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2531805)
