Perfect matchings of a graph
From MaRDI portal
Publication:2531805
DOI10.1016/0095-8956(71)90041-4zbMath0172.48904MaRDI QIDQ2531805
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
Related Items
Sufficient conditions for matchings, Matchings in graphs, The binding number of a graph and its Anderson number, An orientation theorem with parity conditions, On the maximum even factor in weakly symmetric graphs, A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem, The perfectly matchable subgraph polytope of an arbitrary graph, Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem, 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, 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, Unnamed Item, Extremal problems involving neighborhood unions, Unnamed Item, Unnamed Item, Über ein graphentheoretisches Ergebnis von T. Gallai
Cites Work
