Matching theory
From MaRDI portal
Publication:1088987
zbMath0618.05001MaRDI QIDQ1088987
Michael D. Plummer, László Lovász
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
Edge-disjoint packings of graphs, On the computation of pfaffians, PLA folding in special graph classes, Perfect matchings and perfect squares, Persistency in maximum cardinality bipartite matchings, Shellability of chessboard complexes, \(k\)-cycle resonant graphs, Fractional v. integral covers in hypergraphs of bounded edge size, Graph-theoretical conditions for inscribability and Delaunay realizability, Regular coronoid systems, The partition of a uniform hypergraph into pairs of dependent hyperedges, The total chromatic number of any multigraph with maximum degree five is at most seven, Claw-free graphs---a survey, Totally equimatchable graphs, A nice class for the vertex packing problem, On the use of Boolean methods for the computation of the stability number, Row convergence theorems for vector-valued Padé approximants, Optimal packing of induced stars in a graph, The membership problem in jump systems, The \(\beta\)-assignment problem in general graphs, Coloring edges of self-complementary graphs, The parsimonious property of cut covering problems and its applications, Perfect matchings of polyomino graphs, Chair-free Berge graphs are perfect, Complexity of searching an immobile hider in a graph, Perfect matchings and ears in elementary bipartite graphs, The edge chromatic difference sequence of a cubic graph, Block triangularization of skew-symmetric matrices, The delta-sum of matching delta-matroids, Minimum weight \((T,d)\)-joins and multi-joins, Polyhedral characterizations and perfection of line graphs, Counting 1-factors in regular bipartite graphs, Farrell polynomials on graphs of bounded tree width, Handsome proof-nets: Perfect matchings and cographs, A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two, On the graphic matroid parity problem, The linear delta-matroid parity problem, Tile invariants: New horizons., Combinatorics of perfect matchings in plane bipartite graphs and application to tilings., \(M\)-alternating paths in \(n\)-extendable bipartite graphs, 2-factor Hamiltonian graphs., Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph, Planar \(k\)-cycle resonant graphs with \(k=1,2\), A simple minimum \(T\)-cut algorithm, Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets, Cell rotation graphs of strongly connected orientations of plane graphs with an application, Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees, Struction revisited, Clique family inequalities for the stable set polytope of quasi-line graphs., Problems and results in extremal combinatorics. I., Reducible chains of planar 1-cycle resonant graphs, \(Z\)-transformation graphs of maximum matchings of plane bipartite graphs, Number of maximum matchings of bipartite graphs with positive surplus, \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs, Matching properties in domination critical graphs., The Go polynomials of a graph., Bargaining in a network of buyers and sellers., Homogeneous multivariate polynomials with the half-plane property, A matching algorithm for regular bipartite graphs, On the 2-extendability of planar graphs, Minimum spectral radius of a weighted graph, \(f\)-optimal factors of infinite graphs, On the strength of König's duality theorem for infinite bipartite graphs, Compatible 2-factors, Random pseudo-polynomial algorithms for some combinatorial programming problems, Indecomposable regular graphs and hypergraphs, The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable, How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs, Classifying 2-extendable generalized Petersen graphs, On the intersection rank of a graph, Matching theory -- a sampler: From Dénes König to the present, On total covers of graphs, Structural properties of matroid matchings, Approximating the permanent of graphs with large factors, Some results on visibility graphs, Bounds on the largest root of the matching polynomial, Stability number of bull- and chair-free graphs, Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs, On spanning subgraphs of 4-connected planar graphs, The combinatorics of a class of representation functions, Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions, Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian, Matchings in graphs on non-orientable surfaces, Maximum balanced flow in a network, On the algorithmic complexity of twelve covering and independence parameters of graphs, A two-person game on graphs where each player tries to encircle his opponent's men, On matching extensions with prescribed and proscribed edge sets. II, Plane elementary bipartite graphs, Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling, Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs, Bin packing games, The strong Hall property and symmetric chain orders, On the structure of minimally \(n\)-extendable bipartite graphs, Stable sets and polynomials, Predicting the structure of sparse orthogonal factors, On the rotation distance of graphs, An approximation algorithm for the generalized assignment problem, Maximality of the cycle code of a graph, Extending matchings in graphs: A survey, Extending matchings in claw-free graphs, Elementary bipartite graphs and unique colourability, Independent sets of maximum weight in (\(p,q\))-colorable graphs., Structuring the elementary components of graphs having a perfect internal matching., Constraint programming and operations research, Some constrained partitioning problems and majorization, Partition of \(\pi \)-electrons among the faces of polyhedral carbon clusters, Local base station assignment with time intervals in mobile computing environments, Improved bounds for rainbow numbers of matchings in plane triangulations, A generalisation of matching and colouring, Dimer problem for some three dimensional lattice graphs, Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms, Dimers on the \(3^3 . 4^2\) lattice, Regular bipartite graphs with all 2-factors isomorphic, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, On variants of vertex geography on undirected graphs, On approximating (connected) 2-edge dominating set by a tree, A property of the Birkhoff polytope, Selling two goods optimally, Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face, Hall's and Kőnig's theorem in graphs and hypergraphs, Rainbow number of matchings in planar graphs, The skiving stock problem and its relation to hypergraph matchings, Greedy cycles in the star graphs, Structural properties of resonance graphs of plane elementary bipartite graphs, The triangular kagomé lattices revisited, Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs, Extremal coloring for the anti-Ramsey problem of matchings in complete graphs, A sufficient condition for Pfaffian graphs on the torus, Minimal graphs for matching extensions, Fair representation in dimatroids, Global forcing number for maximal matchings, Core index of perfect matching polytope for a 2-connected cubic graph, The graphs whose permanental polynomials are symmetric, Anti-forcing spectrum of any cata-condensed hexagonal system is continuous, On the perfect matching graph defined by a set of cycles, Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket, Degenerate matchings and edge colorings, Maximum matchings in regular graphs, Pfaffian polyominos on the Klein bottle, Approximating bounded-degree spanning trees and connected factors with leaves, A characterization of the resonance graph of an outerplane bipartite graph, State matrix recursion method and monomer-dimer problem, Lower bounds on the uniquely restricted matching number, On bicriticality of (3,6)-fullerene graphs, Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists, Phylogenetic flexibility via Hall-type inequalities and submodularity, Note on extremal graphs with given matching number, Approximation algorithms for connected graph factors of minimum weight, An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs, Problems on matchings and independent sets of a graph, Rainbow matchings in edge-colored complete split graphs, Computing DM-decomposition of a partitioned matrix with rank-1 blocks, How unsplittable-flow-covering helps scheduling with job-dependent cost functions, An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\), Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs, On two extensions of equimatchable graphs, Extremal graphs with respect to generalized ABC index, General cut-generating procedures for the stable set polytope, Constructing graphs which are permanental cospectral and adjacency cospectral, An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion, Curriculum based course timetabling: new solutions to Udine benchmark instances, Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable, The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path., Characterizations of maximum matching graphs of certain types, Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\), Generalizations of matched CNF formulas, Generalized subgraph-restricted matchings in graphs, 4-regular claw-free IM-extendable graphs, Cover-encodings of fitness landscapes, On the depth of combinatorial optimization problems, Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem, An identity for matching and skew-symmetric determinant, Combinatorially orthogonal matrices and related graphs, On two equimatchable graph classes, Local search for the minimum label spanning tree problem with bounded color classes., Matchings and covers in hypergraphs, On the numbers of independent \(k\)-sets in a claw free graph, The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes, Toughness and matching extension in graphs, König-Egerváry graphs, 2-bicritical graphs and fractional matchings, A new proof of a characterisation of Pfaffian bipartite graphs, Packing paths of length at least two, Investigations on autark assignments, Alternating paths in edge-colored complete graphs, Capacities of graphs and \(2\)-matchings, Toughness and the existence of \(k\)-factors. III, On a problem concerning ordered colourings, On extremal multiflows, Vertex set partitions preserving conservativeness, A characterisation of Pfaffian near bipartite graphs, Optimal ear decompositions of matching covered graphs and bases for the matching lattice, On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph, On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic, Scheduling time-constrained multicast messages in circuit-switched tree networks., Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference., Computation of sparse circulant permanents via determinants, Graph-theoretic techniques in D-optimal design problems, A 2-approximation algorithm for the minimum weight edge dominating set problem, 4-edge-coloring graphs of maximum degree 3 in linear time, Geometry of the space of phylogenetic trees, Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs, On the general degree-eccentricity index of a graph, Optimum distance flag codes from spreads via perfect matchings in graphs, Nice pairs of disjoint pentagons in fullerene graphs, Nice pairs of odd cycles in fullerene graphs, Packing stars in fullerenes, A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem, On the feedback vertex set polytope of a series-parallel graph, Matching polytopes, toric geometry, and the totally non-negative Grassmannian., Finding more perfect matchings in leapfrog fullerenes, Faster combinatorial algorithms for determinant and Pfaffian, Structural identifiability in low-rank matrix factorization, Perfect matchings in uniform hypergraphs with large minimum degree, On the dependence polynomial of a graph, A Benders approach for the constrained minimum break problem, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, How to collect balls moving in the Euclidean plane, Ruinous subsets of Richard Thompson's group \(F\)., Models and complexity of multibin packing problems, On the number of matchings of graphs formed by a graph operation, Eliminating graphs by means of parallel knock-out schemes, A min-max result on outerplane bipartite graphs, Graph factors and factorization: 1985--2003: a survey, Spectral radius of graphs with given matching number, Random path method with pivoting for computing permanents of matrices, Computing the inertia from sign patterns, Trees with maximum number of maximal matchings, Structure theorem and algorithm on \((1,f)\)-odd subgraph, Matchings in 3-vertex-critical graphs: the odd case, A characterization of graphs without even factors, Convex nonnegative matrix factorization with manifold regularization, Packing 3-vertex paths in claw-free graphs and related topics, Matchability and \(k\)-maximal matchings, On-line maximum matching in complete multi-partite graphs with an application to optical networks, Computing the least-core and nucleolus for threshold cardinality matching games, Entropy of symmetric graphs, A characterization of minimal non-Seymour graphs, Random scheduling with deadlines under dichotomous preferences, Matching signatures and Pfaffian graphs, 35/44-approximation for asymmetric maximum TSP with triangle inequality, 1-factor covers of regular graphs, Exact solution of the 2d dimer model: corner free energy, correlation functions and combinatorics, Spatial-temporal consistent labeling of tracked pedestrians across non-overlapping camera views, Generalized \(D\)-graphs for nonzero roots of the matching polynomial, A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem, On forcing matching number of boron-nitrogen fullerene graphs, Hamiltonian properties of locally connected graphs with bounded vertex degree, Koszulness, Krull dimension, and other properties of graph-related algebras, Stability preserving transformations of graphs, The complexity of König subgraph problems and above-guarantee vertex cover, On upper bounds for parameters related to the construction of special maximum matchings, Measures of edge-uncolorability, Sampling complete designs, Perfect matchings in total domination critical graphs, Observability analysis and sensor location study for structured linear systems in descriptor form with unknown inputs, Bargaining and efficiency in networks, The maximal \(f\)-dependent set problem for planar graphs is in NC, Problems and progress in vector Padé approximation, Hexagonal systems with forcing single edges, A note on the number of perfect matchings of bipartite graphs, Reliable assignments of processors to tasks and factoring on matroids, Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm, The core of a graph, Extending matchings in planar graphs. IV, The covering radius of the cycle code of a graph, A comparison of two edge-coloring formulations, The even and odd cut polytopes, Minimal cost reconfiguration of data placement in a storage area network, Ear decomposition for pair comparison data, Spaces of singular matrices and matroid parity, Fuzzy morphisms between graphs, Match twice and stitch: a new TSP tour construction heuristic., The perfect matching polytope and solid bricks, Graphs and digraphs with all 2-factors isomorphic, On \(k\)-pairable regular graphs, The global forcing number of the parallelogram polyhex, The chromatic gap and its extremes, A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors, Mean-payoff games and propositional proofs, Spanning trees of 3-uniform hypergraphs, The harmonic index of some graphs, 4-factor-criticality of vertex-transitive graphs, The cycle descent statistic on permutations, A note on \({\mathtt V}\)-free 2-matchings, On the number of disjoint perfect matchings of regular graphs with given edge connectivity, Editing to a planar graph of given degrees, Incremental spectral clustering by efficiently updating the eigen-system, On the location of roots of graph polynomials, On the excessive \([m\)-index of a tree], On the global forcing number of hexagonal systems, Graphs without large apples and the maximum weight independent set problem, On the permanental polynomials of matrices, Integral infeasibility and testing total dual integrality, A simple existence criterion for \((g<f)\)-factors, Restricted matching in plane triangulations and near triangulations, Cube-free resonance graphs, On matroid parity and matching polytopes, A characterization of König-Egerváry graphs with extendable vertex covers, An intersection theorem for supermatroids, Pairwise kidney exchange, 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, General factors of graphs, Undirected distances and the postman-structure of graphs, Matching extension and the genus of a graph, Matching structure and the matching lattice, Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs, NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems, The 2-matching lattice of a graph, Universal maximal packing functions of graphs, The two ear theorem on matching-covered graphs, The planar multiterminal cut problem, On a generalization of ``eight blocks to madness puzzle, Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs, Matchings and \(\Delta\)-matroids, Complexes of graphs with bounded matching size, A note on the cyclical edge-connectivity of fullerene graphs, Solving linear programs from sign patterns, Sign-solvable linear complementarity problems, On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree, Simultaneous matchings: Hardness and approximation, Polyhedral results for a vehicle routing problem, The uniquely solvable bipartite matching problem, A polyhedral approach to edge coloring, Proof of a conjecture on partitions of a Boolean lattice, Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems, A structure theorem for maximum internal matchings in graphs, On some factor theorems of graphs, Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem, Combinatorial proofs of inverse relations and log-concavity for Bessel numbers, Generalized hexagonal systems with each hexagon being resonant, The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory, Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs, Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system, Optimal clustering of multipartite graphs, Minimally non-Pfaffian graphs, Soliton automata with constant external edges, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, Pfaffian graphs, \(T\)-joins and crossing numbers, Pfaffian labelings and signs of edge colorings, On complexity of special maximum matchings constructing, Clique-inserted-graphs and spectral dynamics of clique-inserting, On finding augmenting graphs, Exact algorithms for exact satisfiability and number of perfect matchings, Covering graphs with matchings of fixed size, Minimum rank of skew-symmetric matrices described by a graph, State and input observability recovering by additional sensor implementation: a graph-theoretic approach, An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial, Graphs with the maximum or minimum number of 1-factors, A lower bound on the number of removable ears of 1-extendable graphs, Structural analysis of a fractional matching problem, Optimal cuts in graphs and statistical mechanics, On disjoint matchings in cubic graphs, Chain hexagonal cacti: matchings and independent sets, An improved linear bound on the number of perfect matchings in cubic graphs, Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number, Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph, A Sobolev Poincaré type inequality for integral varifolds, Recognizing near-bipartite Pfaffian graphs in polynomial time, An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem, Computing sharp 2-factors in claw-free graphs, Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs, Exploring uses of persistent homology for statistical analysis of landmark-based shape data, Optimality conditions for Hunter's bound, Bipartite matching extendable graphs, On edge-disjoint pairs of matchings, On the maximal signless Laplacian spectral radius of graphs with given matching number, On a theorem of Sewell and Trotter, 2-extendability of toroidal polyhexes and Klein-bottle polyhexes, On the matching polynomial of subdivision graphs, Matchings in regular graphs from eigenvalues, Characterization of a class of graphs related to pairs of disjoint matchings, Factor-critical property in 3-dominating-critical graphs, \((s,m)\)-radius of \(k\)-connected graphs, Weighted graphs defining facets: A connection between stable set and linear ordering polytopes, Weighted restricted 2-matching, The \(k\)-assignment polytope, Factor-critical graphs with given number of maximum matchings, Menger's theorem for infinite graphs, Dimension and enumeration of primitive ideals in quantum algebras., Approximation algorithms for multi-criteria traveling salesman problems, Statistics to measure correlation for data mining applications, Fibonacci-like cubes as \(Z\)-transformation graphs, On fixed points of permutations., Bipartite rainbow numbers of matchings, Complete solution for the rainbow numbers of matchings, Minimum-weight cycle covers and their approximability, Some complexity problems on single input double output controllers, List edge multicoloring in graphs with few cycles, Optimizing the marriage market: an application of the linear assignment model, An extension of the bivariate chromatic polynomial, Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs, Bounds on maximum \(b\)-matchings, Graphs with restricted valency and matching number, Bounding the size of equimatchable graphs of fixed genus, Minimal 2-matching-covered graphs, An application of Tutte's theorem to 1-factorization of regular graphs of high degree, Coloring by two-way independent sets, The graph of perfect matching polytope and an extreme problem, Linear-time certifying algorithms for near-graphical sequences, A novel texture clustering method based on shift invariant DWT and locality preserving projection, An automaton-theoretic approach to the representation theory of quantum algebras, Leray numbers of complexes of graphs with bounded matching number, Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices, Edge guards for polyhedra in three-space, It is tough to be a plumber, On the \(p\)-factor-criticality of the Klein bottle, The combinatorial approach yields an NC algorithm for computing Pfaffians, Characterization of saturated graphs related to pairs of disjoint matchings, Adaptive paired comparison design, On cycle-nice claw-free graphs, Shortest perfect pseudomatchings in fullerene graphs, Complete forcing numbers of hexagonal systems. II, A new approach to solving three combinatorial enumeration problems on planar graphs, Polynomially solvable cases for the maximum stable set problem, An identity for bipartite matching and symmetric determinant, Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form, Complexity of circuit intersection in graphs, Spectra of weighted uniform hypertrees, Critical independent sets of König-Egerváry graphs, A theorem on the principal structure for independent matchings, On some algorithmic investigations of star partitions of graphs, Gröbner bases and triangulations of the second hypersimplex, Factorially many maximum matchings close to the Erdős-Gallai bound, Multiplicity of integer roots of polynomials of graphs, On 2-extendable abelian Cayley graphs, Dimer coverings of 1-slab cubic lattices, Truncation of wavelet matrices: Edge effects and the reduction of topological control, Rainbow matchings in an edge-colored planar bipartite graph, Stability critical graphs and ranks facets of the stable set polytope, A local reductive elimination for the fill-in of graphs, Cycle packings in graphs and digraphs, Some more updates on an annihilation number conjecture: pros and cons, Bicritical graphs without removable edges, Toughness, hamiltonicity and split graphs, Extending matchings in planar graphs. V, Faster algorithm for finding maximum 1-restricted simple 2-matchings, On 4-connected claw-free well-covered graphs, Coronoid systems with perfect matchings, Minimizing submodular functions on diamonds via generalized fractional matroid matchings, A characterization of well-indumatchable graphs having girth greater than seven, Inequalities for the gamma function with applications to permanents, Independence number in \(n\)-extendable graphs, An upper bound on the independence number of a graph computable in polynomial-time, Cayley's theorem and its application in the theory of vector Padé approximants, An application of matching theory of edge-colourings, Rounding in symmetric matrices and undirected graphs, On Cartesian product of factor-critical graphs, Critical independent sets and König-Egerváry graphs, A generalization of Little's theorem on Pfaffian orientations, On the characterizing properties of the permanental polynomials of graphs, Tensorized feature extraction technique for multimodality preserving manifold visualization, The number of Kekulé structures of polyominos on the torus, Regularized nonnegative shared subspace learning, Associated primes of powers of edge ideals, Star-uniform graphs, Phase transition in the spanning-hyperforest model on complete hypergraphs, An improved kernel for max-bisection above tight lower bound, Perfect matchings and \(K_{1,p}\)-restricted graphs, Kekulé structures of honeycomb lattice on Klein bottle and Möbius strip, Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial, On characterizing the critical graphs for matching Ramsey numbers, Chromatic index of simple hypergraphs, Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach, The Pfaffian property of Cartesian products of graphs, Restricted 2-extendability of (3,6)-fullerenes, Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs, Dispersing obnoxious facilities on a graph, A characterization of graphs with given maximum degree and smallest possible matching number, Matching and edge-connectivity in graphs with given maximum degree, Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section, Flows on measurable spaces, On the matching and permanental polynomials of graphs, Complete forcing numbers of hexagonal systems, Scaling matrices and counting the perfect matchings in graphs, Spectral strengthening of a theorem on transversal critical graphs, A characterization of graphs with given maximum degree and smallest possible matching number. II, Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs, Regular graphs with equal matching number and independence number, On the expected number of perfect matchings in cubic planar graphs, A note on maximum fractional matchings of graphs, Local metric dimension for graphs with small clique numbers, An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem, The general graph matching game: approximate core, Relations between global forcing number and maximum anti-forcing number of a graph, Newton polytopes of nondegenerate quadratic forms, Minimum cost \(b\)-matching problems with neighborhoods, PM-compact graphs and vertex-deleted subgraphs, Maximum size of a graph with given fractional matching number, On the \(A_\alpha\)-spectral radius of graphs without large matchings, A real polynomial for bipartite graph minimum weight perfect matchings, A majorization-minimization based solution to penalized nonnegative matrix factorization with orthogonal regularization, Some tight bounds on the minimum and maximum forcing numbers of graphs, Output sensitive fault tolerant maximum matching, On maximum matchings in 5-regular and 6-regular multigraphs, Equimatchable bipartite graphs, Locally defined independence systems on graphs, A generalization of Petersen's matching theorem, On the number of perfect matchings in the line graph of a traceable graph, Some extremal problems on the distance involving peripheral vertices of trees with given matching number, The characterization of \(p\)-factor-critical graphs, The inertia and energy gap of a vertex-decorated graph with identically weighted `internal' edges and beyond, On the complexity of the identifiable subgraph problem, revisited, The replacement principle in networked economies with single-peaked preferences, On the bivariate permanent polynomials of graphs, Transversals and independence in linear hypergraphs with maximum degree two, On the vertex packing problem, Degree complete graphs, A note on minimal matching covered graphs, On trees with a maximum proper partial 0-1 coloring containing a maximum matching, Generalization of matching extensions in graphs. II., Tutte sets in graphs. II: The complexity of finding maximum Tutte sets, A quadratic identity for the number of perfect matchings of plane graphs, Note on maximal split-stable subgraphs, Replacing Pfaffians and applications, Tutte type theorems for graphs having a perfect internal matching, On approximability of optimization problems related to red/blue-split graphs, Boundary classes for graph problems involving non-local properties, Graph matching problems and the NP-hardness of sortedness constraints, From matchings to independent sets, Regular coronoids and 4-tilings, Upper tails and independence polynomials in random graphs, Global forcing number for maximal matchings in corona products, Editing to a connected graph of given degrees, The average size of matchings in graphs, Extendability and criticality in matching theory, More efficient oblivious transfer extensions, On sequences of polynomials arising from graph invariants, A conjecture of Norine and Thomas for abelian Cayley graphs, Fair representation in the intersection of two matroids, Irreducible decomposition of powers of edge ideals, Single coronoid systems with an anti-forcing edge, Minimal graphs for 2-factor extension, Equivalence classes in matching covered graphs, On the anti-Kekulé number of (4, 5, 6)-fullerenes, Subspace learning by \(\ell^0\)-induced sparsity, The Pfaffian property of Cayley graphs on dihedral groups, On caterpillar factors in graphs, Exact Ramsey numbers of odd cycles via nonlinear optimisation, Using edge generating function to solve monomer-dimer problem, Ramsey numbers of path-matchings, covering designs, and 1-cores, An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs, On specific factors in graphs, Jones' conjecture in subcubic graphs, Line graph links, Polynomial time complexity of edge colouring graphs with bounded colour classes, Popular and clan-popular \(b\)-matchings, The skeleton of acyclic Birkhoff polytopes, A bound for the number of vertices of a polytope with applications, A logician's view of graph polynomials, On some structural properties of generalized fullerene graphs with 13 pentagonal faces, New kernels for several problems on planar graphs, Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions, Rainbow numbers for small graphs in planar graphs, Dynamic programming optimization in line of sight networks, On some hard and some tractable cases of the maximum acyclic matching problem, On essentially 4-edge-connected cubic bricks, On the König deficiency of zero-reducible graphs, Nontrivial path covers of graphs: existence, minimization and maximization, Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3, Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut, Zero forcing in claw-free cubic graphs, Matching extendability and connectivity of regular graphs from eigenvalues, The edge-connectivity of strongly 3-walk-regular graphs, Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks, Matching preclusion for direct product of regular graphs, Structure and enumeration results of matchable Lucas cubes, The \(B\)-model connection and mirror symmetry for Grassmannians, \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks, A note on \(m\)-near-factor-critical graphs, Derangement action digraphs and graphs, Detecting strong cliques, A novel framework for the NMF methods with experiments to unmixing signals and feature representation, On power ideals of transversal matroids and their ``parking functions, Semantic distance between vague concepts in a framework of modeling with words, Clar structures vs Fries structures in hexagonal systems, Positive semidefinite zero forcing numbers of two classes of graphs, Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage, Approximating maximum uniquely restricted matchings in bipartite graphs, The train frequency compatibility problem, Skeleton matching polytope: realization and isomorphism, Critical paired dominating sets and irreducible decompositions of powers of edge ideals, On the permanental sum of graphs, Combinatorial properties of Farey graphs, Paths and trails in edge-colored weighted graphs, Enumeration of perfect matchings of lattice graphs by Pfaffians, Monochromatic plane matchings in bicolored point set, Pairwise constrained concept factorization for data representation, Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs, Oriented Euler complexes and signed perfect matchings, Fixed-parameter tractability for subset feedback set problems with parity constraints, Priority matchings revisited, A generalization of extension complexity that captures P, Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes, A refined complexity analysis of degree anonymization in graphs, Maximum induced matchings close to maximum matchings, Efficient recognition of equimatchable graphs, Matching preclusion for cube-connected cycles, A characterization of PM-compact Hamiltonian bipartite graphs, Bipartite double cover and perfect 2-matching covered graph with its algorithm, On interval \(\Delta\)-coloring of bipartite graphs, Parametric bisubmodular function minimization and its associated signed ring family, \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard, Calculation of Pfaffians by a chip removal, Matching structure and bargaining outcomes in buyer-seller networks, Combinatorics and algorithms for augmenting graphs, Towards Boij-Söderberg theory for Grassmannians: the case of square matrices, An infinite family of graphs with a facile count of perfect matchings, Decomposition theorem on matchable distributive lattices, The algebraic connectivity of graphs with given matching number, Generating bricks, A 1.75-approximation algorithm for unsigned translocation distance, The complexity of recognizing minimally tough graphs, Ear-slicing for matchings in hypergraphs, Exact rainbow numbers for matchings in plane triangulations, Peripheral convex expansions of resonance graphs, Decomposition theorems for square-free 2-matchings in bipartite graphs, Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces, Edge-stable equimatchable graphs, On the complexity landscape of connected \(f\)-factor problems, On the facets of stable set polytopes of circular interval graphs, Uniquely restricted matchings in subcubic graphs, The Pfaffian property of graphs on the Möbius strip based on topological resolution, A splitter theorem for 3-connected 2-polymatroids, Perfect matchings on a type of lattices with toroidal boundary, Ear decomposition and induced even cycles, Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model, On two conjectures concerning total domination subdivision number in graphs, Sets of elements that pairwise generate a linear group, Bayesian locally optimal design of knockout tournaments, Forcing faces in plane bipartite graphs, Forcing and anti-forcing polynomials of a type of polyomino graphs, Permanents of hexagonal and armchair chains, How to build a brick, Classes of perfect graphs, Analysis of multi-stage open shop processing systems, On oriented graphs whose skew spectral radii do not exceed 2, Gallai-Edmonds structure theorem for weighted matching polynomial, Generic pole assignability, structurally constrained controllers and unimodular completion, On complementary coverage of \({\Omega}_n(T)\), Counting spanning trees using modular decomposition, Pfaffian orientations for a type of bipartite graph, Second kind maximum matching graph, On perfect \(k\)-matchings, Minimal bricks have many vertices of small degree, A note on the permanental roots of bipartite graphs, Transfer distance between partitions, Forbidden subgraphs and the König-Egerváry property, Kidney exchange: further utilization of donors via listed exchange, On maximum matchings in König-Egerváry graphs, Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems, A reduction algorithm for the weighted stable set problem in claw-free graphs, The maximum vertex coverage problem on bipartite graphs, Computing the differential of a graph: hardness, approximability and exact algorithms, On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs, A note on graphs contraction-critical with respect to independence number, Sequential legislative lobbying, Bi-criteria and approximation algorithms for restricted matchings, Perfect matchings in planar cubic graphs, 3-factor-criticality in domination critical graphs, Perfect matchings after vertex deletions, Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids, Generalizing \(D\)-graphs, On the complexity of general matrix scaling and entropy minimization via the RAS algorithm, The path partition problem and related problems in bipartite graphs, A short update on equipackable graphs, Matching properties in connected domination critical graphs, Crown reductions for the minimum weighted vertex cover problem, Maximum weight edge-constrained matchings, Pseudo 2-factor isomorphic regular bipartite graphs, A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design, Degree constrained subgraphs, Characterizing minimally \(n\)-extendable bipartite graphs, Counting perfect matchings in \(n\)-extendable graphs, Oriented star packings, An algorithm for computing the matching capacity, Vertex colouring edge partitions, Extension of a list coloring problem, A pair of forbidden subgraphs and perfect matchings., Augmenting chains in graphs without a skew star., Complexity results on restricted instances of a paint shop problem for words, A combinatorial algorithm for weighted stable sets in bipartite graphs, Well-covered graphs and factors, Perfect matchings of generalized polyomino graphs, Toughness in graphs -- a survey, Minimal bricks, Construction for bicritical graphs and \(k\)-extendable bipartite graphs, Facets of the linear ordering polytope: a unification for the fence family through weighted graphs, On \(\alpha\)-critical edges in König--Egerváry graphs, \(k\)-resonance in toroidal polyhexes, The \(f\)-factor problem for graphs and the hereditary property, How to recycle your facets, Berge's theorem for the maximum charge problem, Pfaffian orientations and perfect matchings of scale-free networks, Factor-critical graphs with the minimum number of near-perfect matchings, Equality of distance packing numbers, Saturation and associated primes of powers of edge ideals, On the odd-minor variant of Hadwiger's conjecture, Degree of indecomposability of certain highly regular zero-one matrices, Forcing bonds of a benzenoid system, On edge-colored graphs covered by properly colored cycles, Enumeration of perfect matchings of a type of Cartesian products of graphs, The number of disjoint perfect matchings in semi-regular graphs, Maximum and optimal 1-2 matching problem of the different kind, Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation, Reverse Mathematics: The Playground of Logic, On the Size of Matchings in 1-Planar Graph with High Minimum Degree, Belief propagation and loop series on planar graphs, Saturation of Newton polytopes of type A and D cluster variables, Unnamed Item, On Two Unsolved Problems Concerning Matching Covered Graphs, On the Permanental Polynomial and Permanental Sum of Signed Graphs, Energy-Efficient Algorithms for Non-preemptive Speed-Scaling, A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter, Construction of k-matchings in graph products, Minimum weight euclidean matching and weighted relative neighborhood graphs, The Jones polynomials of three-bridge knots via Chebyshev knots and billiard table diagrams, Note on distance signless Laplacian spectral radius under given matching number, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs, MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB, Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries, The Generalized Popular Condensation Problem, Unnamed Item, Antifactors of regular bipartite graphs, Even cycles and perfect matchings in claw-free plane graphs, A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, Minimum-Weight Cycle Covers and Their Approximability, On the Number of α-Orientations, Structural Identifiability in Low-Rank Matrix Factorization, Majority edge-colorings of graphs, Convergence of graphs with intermediate density, Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching, Set-syllogistics meet combinatorics, On the Structure of Graphs Vertex Critical with Respect to Connected Domination, Counting the maximal and perfect matchings in benzenoid chains, Enumeration of perfect matchings of the Cartesian products of graphs, Graph toughness from Laplacian eigenvalues, Combination algorithms for Steiner tree variants, Unnamed Item, A Note on the Existence of All (g,f)-Factors, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, Unnamed Item, The Alcuin Number of a Graph, Fractal Dimensions and Random Transformations, Tighter Bounds for Online Bipartite Matching, A New Lower Bound for Positive Zero Forcing, An equivalent formulation of the Fan-Raspaud Conjecture and related problems, Identities between dimer partition functions on different surfaces, Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version), Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes, A characterization of Konig-Egervary graphs using a common property of all maximum matchings, A submodular optimization problem with side constraints, The strongest facets of the acyclic subgraph polytope are unknown, Conformal Wasserstein distance: II. computational aspects and extensions, The monoidal structure of Turing machines, Polynomial algorithm for finding the largest independent sets in graphs without forks, On the number of dissimilar pfaffian orientations of graphs, Computing Sharp 2-Factors in Claw-Free Graphs, Unnamed Item, Degree-Constrained Subgraph Problems: Hardness and Approximation Results, Graph Stabilization: A Survey, A Wheels-and-Whirls Theorem for $3$-Connected $2$-Polymatroids, The Banach-Tarski Theorem on Polygons, and the Cancellation Law, An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm, Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights, Complete Forcing Numbers of Polyphenyl Systems, Anti-forcing number of some specific graphs, Eternal and Secure Domination in Graphs, INDEPENDENCE AND PI POLYNOMIALS FOR FEW STRINGS, Semantic Equivalence of Graph Polynomials Definable in Second Order Logic, Fuzzy c-means clustering with conditional probability based K–L information regularization, Arbitrarily regularizable graphs, On Sylvester Colorings of Cubic Graphs, Upper bounds on the energy of graphs in terms of matching number, New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition, Planar Maximum Matching: Towards a Parallel Algorithm, Dispersing Obnoxious Facilities on a Graph, Factors of claw-free graphs, Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs, On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph, Ear decompositions of join covered graphs, Forbidden subgraphs and the Kőnig property, Bipartite Perfect Matching is in Quasi-NC, Matching polytopes and Specht modules, Signed ring families and signed posets, Cubic bridgeless graphs have more than a linear number of perfect matchings, Polynomial reconstruction of the matching polynomial, A note on extreme sets, Duality and Optimality of Auctions for Uniform Distributions, Edge-Critical Equimatchable Bipartite Graphs, Matchings in complete bipartite graphs and the $r$-Lah numbers, Covering Graphs by Colored Stable Sets, On a weighted generalization of α-critical graphs, Matching Theory and Economic Model Building, Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors, A hypergraph version of the Gallai-Edmonds Theorem, On some approximately balanced combinatorial cooperative games, EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET, Maximal matchings in polyspiro and benzenoid chains, Game $k$-Domination Number of Graphs, Some Results on Fractional Graph Theory, Conjecture of TxGraffiti: Independence, domination, and matchings, On the approximability of the maximum common subgraph problem, Review of the theory of stable matchings and contract systems, On the dimer problem of the vertex-edge graph of a cubic graph, The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number, A complete description of convex sets associated with matchings and edge‐connectivity in graphs, Blocking trails for \(f\)-factors of multigraphs, A weight-scaling algorithm for \(f\)-factors of multigraphs, A characterization of Seymour graphs, A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number, Minimal braces, Uniquely restricted matchings in subcubic graphs without short cycles, Matchings in 1‐planar graphs with large minimum degree, Perfect forests in graphs and their extensions, A local algorithm and its percolation analysis of bipartite z-matching problem, Enumeration of maximum matchings in the Hanoi graphs using matching polynomials, Bipartite perfect matching as a real polynomial, Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs, Monochromatic connected matchings in 2‐edge‐colored multipartite graphs, On the roots of (signless) Laplacian permanental polynomials of graphs, Optimal general factor problem and jump system intersection, A matching-minor monotone parameter for bipartite graphs, Perfect matching in bipartite hypergraphs subject to a demand graph, Smallest maximal matchings of graphs, FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective, Equivariant log-concavity of graph matchings, Maximum skew-symmetric flows, Self-simulation for the Passive Optical Star model, Sequential importance sampling for estimating expectations over the space of perfect matchings, Approximations for the Steiner multicycle problem, Matching supply and demand for free-floating car sharing: on the value of optimization, Minimally \(k\)-factor-critical graphs for some large \(k\), Repeatedly matching items to agents fairly and efficiently, Removable edges in Halin graphs, Graphs with each edge in at most one maximum matching, On critical difference, independence number and matching number of graphs, A characterization of nonfeasible sets in matching covered graphs, Generating simple near‐bipartite bricks, Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime, Anti-Ramsey number of matchings in outerplanar graphs, On the number of high‐dimensional partitions, Orthogonally constrained matrix factorization for robust unsupervised feature selection with local preserving, Unnamed Item, Unnamed Item, Two faces of greedy leaf removal procedure on graphs, Faster Combinatorial Algorithms for Determinant and Pfaffian, A Weighted Linear Matroid Parity Algorithm, Quadratic forms on graphs, Polychromatic colorings of plane graphs, Bicolored matchings in some classes of graphs, Circular edge-colorings of cubic graphs with girth six, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, Wilf’s conjecture for numerical semigroups with large second generator, Monomer-dimer problem on random planar honeycomb lattice, On the maximum edge-pair embedding bipartite matching, The computational complexity of antimatroid properties, On Approximating (Connected) 2-Edge Dominating Set by a Tree, A set packing model for the ground holding problem in congested networks, Persistency in combinatorial optimization problems on matroids, An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs, Sparse universal graphs for bounded‐degree graphs, The cut cone. III: On the role of triangle facets, On generalizations of matching-covered graphs, Faster algorithm for finding maximum 1-restricted simple 2-matchings, Angular momentum theory, umbral calculus, and combinatorics, Counting over non-planar graphs, A lower bound for the shortest path problem, Counting domino tilings of rectangles via resultants, Spaces of \(p\)-vectors of bounded rank, Packing and covering odd cycles in cubic plane graphs with small faces, Anti-forcing numbers of perfect matchings of graphs, 1.61-approximation for min-power strong connectivity with two power levels, Spectral characterization of matchings in graphs, Approximating multistage matching problems, Approximating multistage matching problems, Matchings in 3‐vertex‐critical graphs: The even case, Matching, path covers, and total forcing sets, Block allocation of a sequential resource, When Is the Matching Polytope Box-Totally Dual Integral?, Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, Unnamed Item, Unnamed Item, The geometry of dimer models, The number of matchings in random graphs, Fermions and loops on graphs: II. A monomer–dimer model as a series of determinants, On the number ofk-cycles in the assignment problem for random matrices, The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs, Unnamed Item, Parameterized Graph Editing with Chosen Vertex Degrees, Fully Dynamic Maximal Matching in $O(\log n)$ Update Time, Distributed link scheduling in wireless networks, Pattern Formation by Oblivious Asynchronous Mobile Robots, On some parameters related to matching of graph powers, Surface Embedding of Non-Bipartite $k$-Extendable Graphs, Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems, Faster algorithms for half-integral T -Path packing, An extremal problem on Q-spectral radii of graphs with given size and matching number, Complete forcing numbers of graphs, COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB, Fully Online Matching with Advice on General Bipartite Graphs and Paths, Resonance graphs on perfect matchings of graphs on surfaces, Matching extension and distance spectral radius, Maximum weight perfect matching problem with additional disjunctive conflict constraints, An improved algorithm for finding maximum outerplanar subgraphs, Dominoes, New approximation results on graph matching and related problems, Finding large planar subgraphs and large subgraphs of a given genus, Turán graphs with bounded matching number, Integer \(k\)-matching preclusion of some interconnection networks, Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\), How many matchings cover the nodes of a graph?, Unnamed Item
