Matching theory
From MaRDI portal
Publication:1088987
zbMath0618.05001MaRDI QIDQ1088987
Publication date: 1986
Published in: Annals of Discrete Mathematics (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)
Related Items (only showing first 100 items - show all)
König graphs for 3-paths and 3-cycles ⋮ A maximum resonant set of polyomino graphs ⋮ A minimax result for perfect matchings of a polyomino graph ⋮ Equistarable bipartite graphs ⋮ On the skew-permanental polynomials of orientation graphs ⋮ Matching preclusion for vertex-transitive networks ⋮ A polynomial algorithm for the extendability problem in bipartite graphs ⋮ A polynomial time solvable instance of the feasible minimum cover problem ⋮ Win-win kernelization for degree sequence completion problems ⋮ Rural postman parameterized by the number of components of required edges ⋮ Packing non-zero \(A\)-paths via matroid matching ⋮ On graphs with induced matching number almost equal to matching number ⋮ Computing an evolutionary ordering is hard ⋮ A strengthened general cut-generating procedure for the stable set polytope ⋮ The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ Complete forcing numbers of primitive coronoids ⋮ Fast algorithm to find 2-factor of minimum weight ⋮ The VC-dimension of graphs with respect to \(k\)-connected subgraphs ⋮ A recurrent algorithm to solve the weighted matching problem ⋮ Graphs with maximal induced matchings of the same size ⋮ Graph invertibility and median eigenvalues ⋮ On the location of roots of independence polynomials ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ On the maximum even factor in weakly symmetric graphs ⋮ Large chromatic number and Ramsey graphs ⋮ When is \(G^2\) a König-Egerváry graph? ⋮ A study of monopolies in graphs ⋮ Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ Excessive factorizations of bipartite multigraphs ⋮ Extensions of barrier sets to nonzero roots of the matching polynomial ⋮ Pfaffian graphs embedding on the torus ⋮ Enumerating perfect matchings in \(n\)-cubes ⋮ 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes ⋮ Forbidden induced subgraphs for near perfect matchings ⋮ On the cores of games arising from integer edge covering functions of graphs ⋮ Bend-optimal orthogonal graph drawing in the general position model ⋮ Generalizing Tutte's theorem and maximal non-matchable graphs ⋮ Average connectivity and average edge-connectivity in graphs ⋮ Three-matching intersection conjecture for perfect matching polytopes of small dimensions ⋮ Induced matchings in subcubic graphs without short cycles ⋮ Matchings in graphs of odd regularity and girth ⋮ On maximum matchings in almost regular graphs ⋮ On the size of 3-uniform linear hypergraphs ⋮ The critical independence number and an independence decomposition ⋮ Rainbow numbers for matchings in plane triangulations ⋮ General fractional \(f\)-factor numbers of graphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Altruistically unbalanced kidney exchange ⋮ Matching covered graphs with three removable classes ⋮ The number of maximum matchings in a tree ⋮ A superlinear bound on the number of perfect matchings in cubic bridgeless graphs ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ On bounded block decomposition problems for under-specified systems of equations ⋮ The characteristic polynomial and the matchings polynomial of a weighted oriented graph ⋮ Skew-adjacency matrices of graphs ⋮ On the NP-completeness of the perfect matching free subgraph problem ⋮ Finding all maximally-matchable edges in a bipartite graph ⋮ A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs ⋮ A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs ⋮ Some upper bounds for the atom-bond connectivity index of graphs ⋮ Computing the permanental polynomials of bipartite graphs by Pfaffian orientation ⋮ On the approximability of some degree-constrained subgraph problems ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Generalization of Erdős-Gallai edge bound ⋮ On \(k\)-resonance of grid graphs on the plane, torus and cylinder ⋮ Kauffman's clock lattice as a graph of perfect matchings: a formula for its height ⋮ A new lower bound for the number of perfect matchings of line graph ⋮ The Pfaffian property of circulant graphs ⋮ Non-matchable distributive lattices ⋮ Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs ⋮ A model for minimizing active processor time ⋮ Dulmage-Mendelsohn canonical decomposition as a generic pruning technique ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ Face-width of Pfaffian braces and polyhex graphs on surfaces ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ Stiefel tropical linear spaces ⋮ Characterizations of Mersenne and 2-rooted primes ⋮ On graphs with a unique perfect matching ⋮ Two greedy consequences for maximum induced matchings ⋮ Some results on the reciprocal sum-degree distance of graphs ⋮ Classical information storage in an \(n\)-level quantum system ⋮ Successive partition of edges of bipartite graph into matchings ⋮ Induced cycles in graphs ⋮ Cubic bridgeless graphs and braces ⋮ Odd properly colored cycles in edge-colored graphs ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Greedy matching: guarantees and limitations ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph ⋮ Efficient stabilization of cooperative matching games ⋮ Maximum matchings in scale-free networks with identical degree distribution ⋮ 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes ⋮ Computing large matchings in planar graphs with fixed minimum degree ⋮ Reconstructing polygons from scanner data ⋮ Exponentially many perfect matchings in cubic graphs ⋮ Faces of Birkhoff Polytopes ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges ⋮ Fast algorithms for the undirected negative cost cycle detection problem
This page was built for publication: Matching theory
