Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Recommendations
Cited in
(only showing first 100 items - show all)- Tile invariants: New horizons.
- On the approximability of some degree-constrained subgraph problems
- Random path method with pivoting for computing permanents of matrices
- Critical independent sets and König-Egerváry graphs
- Associated primes of powers of edge ideals
- Line graph links
- On the global forcing number of hexagonal systems
- The path partition problem and related problems in bipartite graphs
- On maximum matchings in König-Egerváry graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Complexity of circuit intersection in graphs
- A recurrent algorithm to solve the weighted matching problem
- Graph factors and factorization: 1985--2003: a survey
- Randomly colouring graphs (a combinatorial view)
- Crown reductions for the minimum weighted vertex cover problem
- Graph invertibility and median eigenvalues
- Matching structure and the matching lattice
- A polynomial algorithm for the extendability problem in bipartite graphs
- Matching supply and demand for free-floating car sharing: on the value of optimization
- A characterisation of Pfaffian near bipartite graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Cycle packings in graphs and digraphs
- 35/44-approximation for asymmetric maximum TSP with triangle inequality
- Toughness in graphs -- a survey
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
- General factors of graphs
- The generalized popular condensation problem
- A refined complexity analysis of degree anonymization in graphs
- Toughness, hamiltonicity and split graphs
- Minimum rank of skew-symmetric matrices described by a graph
- Pfaffian orientations and perfect matchings of scale-free networks
- Chain hexagonal cacti: matchings and independent sets
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- When is \(G^2\) a König-Egerváry graph?
- A study of monopolies in graphs
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Large chromatic number and Ramsey graphs
- Classical information storage in an \(n\)-level quantum system
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Enumerating perfect matchings in \(n\)-cubes
- Pfaffian graphs embedding on the torus
- Planar Maximum Matching: Towards a Parallel Algorithm
- On the approximability of the maximum common subgraph problem
- A lower bound for the shortest path problem
- Generalization of matching extensions in graphs. II.
- Convergence of graphs with intermediate density
- A pair of forbidden subgraphs and perfect matchings.
- A Benders approach for the constrained minimum break problem
- A randomized polynomial kernelization for vertex cover with a smaller parameter
- Forbidden induced subgraphs for near perfect matchings
- On the cores of games arising from integer edge covering functions of graphs
- The chromatic gap and its extremes
- Bend-optimal orthogonal graph drawing in the general position model
- Reverse mathematics: the playground of logic
- Stability critical graphs and ranks facets of the stable set polytope
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- The \(B\)-model connection and mirror symmetry for Grassmannians
- A weighted linear matroid parity algorithm
- On maximum matchings in almost regular graphs
- Sparse universal graphs for bounded‐degree graphs
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
- Sets of elements that pairwise generate a linear group
- Rural postman parameterized by the number of components of required edges
- On disjoint matchings in cubic graphs
- Packing non-zero \(A\)-paths via matroid matching
- On the matching polynomial of subdivision graphs
- Matchings in graphs on non-orientable surfaces
- A strengthened general cut-generating procedure for the stable set polytope
- Computing an evolutionary ordering is hard
- On graphs with induced matching number almost equal to matching number
- Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Complete forcing numbers of primitive coronoids
- The number of matchings in random graphs
- Editing graphs to satisfy degree constraints: a parameterized approach
- Editing to a connected graph of given degrees
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Extending matchings in graphs: A survey
- Fast algorithm to find 2-factor of minimum weight
- Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs
- The critical independence number and an independence decomposition
- Exponentially many perfect matchings in cubic graphs
- A note on extreme sets
- A polynomial time solvable instance of the feasible minimum cover problem
- Fibonacci-like cubes as \(Z\)-transformation graphs
- Minimum-weight cycle covers and their approximability
- Polyhedral results for a vehicle routing problem
- Win-win kernelization for degree sequence completion problems
- Matching preclusion for vertex-transitive networks
- Counting 1-factors in regular bipartite graphs
- Graphs with maximal induced matchings of the same size
- The uniquely solvable bipartite matching problem
- Shellability of chessboard complexes
- On the location of roots of graph polynomials
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
This page was built for publication: Matching theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088987)
