Perfect matchings of a graph

DOI10.1016/0095-8956(71)90041-4zbMath0172.48904OpenAlexW2021423349MaRDI QIDQ2531805

Ian Anderson

Publication date: 1971

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(71)90041-4

zbMATH Keywords

topology

Related Items (35)

Factors and factorizations of graphs—a survey ⋮ Toughness, binding number and restricted matching extension in a graph ⋮ On the maximum even factor in weakly symmetric graphs ⋮ The two ear theorem on matching-covered graphs ⋮ Unnamed Item ⋮ On the graphic matroid parity problem ⋮ A sufficient condition for the existence of a k-factor excluding a given r-factor ⋮ Graphs associated with vector spaces of even dimension: A link with differential geometry ⋮ Sufficient conditions for matchings ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ Matchings in graphs ⋮ A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem ⋮ Binding number and Hamiltonian (g, f)-factors in graphs II ⋮ Linear hypergraphs with large transversal number and maximum degree two ⋮ A sufficient condition for a graph to have \([a,b\)-factors] ⋮ Extremal problems involving neighborhood unions ⋮ Neighborhood conditions and edge-disjoint perfect matchings ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Binding numbers and \(f\)-factors of graphs ⋮ Matchings in graphs. II ⋮ The binding number of a graph and its Anderson number ⋮ A new characterization of the maximum genus of a graph ⋮ Unnamed Item ⋮ An orientation theorem with parity conditions ⋮ Über ein graphentheoretisches Ergebnis von T. Gallai ⋮ The number of 1-factors in 2k-connected graphs ⋮ Matching extendability and connectivity of regular graphs from eigenvalues ⋮ The edge-connectivity of strongly 3-walk-regular graphs ⋮ Computing the binding number of a graph ⋮ The perfectly matchable subgraph polytope of an arbitrary graph ⋮ 1-Faktoren von Graphen. (1-factors of graphs) ⋮ Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem ⋮ Triangles and neighbourhoods of independent sets in graphs ⋮ On factors with all degrees odd

Cites Work

• On Representatives of Subsets
• The Factorization of Linear Graphs
• A Note on Tutte's Paper “The Factorization of Linear Graphs”^*
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect matchings of a graph