Cited in
(only showing first 100 items - show all)- Cycle games on graphs
- Allocating costs in set covering problems
- Fair-by-design matching
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Toughness in graphs -- a survey
- Cayley factorization and the area principle
- The graphs with maximum induced matching and maximum matching the same size
- Linear time approximation algorithms for~degree~constrained subgraph problems
- An Algorithm for a Minimum Cover of a Graph
- Heuristically guided search and chromosome matching
- Benders decomposition for network design covering problems
- A survey of direct methods for sparse linear systems
- Hierarchical \(b\)-matching
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- Perfect matching in random graphs is as hard as Tseitin
- An efficient distributed algorithm for maximum matching in general graphs
- A condition on Hamilton-connected line graphs
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- On two extensions of equimatchable graphs
- Tiling with Squares and Packing Dominos in Polynomial Time
- Recomputing causality assignments on lumped process models when adding new simplification assumptions
- Bipartite matching in the semi-streaming model
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets
- Bottleneck partial-matching Voronoi diagrams and applications
- Maximum-expectation matching under recourse
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
- Packings by Complete Bipartite Graphs
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- Structural identifiability in low-rank matrix factorization
- Augmenting approach for some maximum set problems
- On generalized matching problems
- Covers and packings in a family of sets
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- Matching and spanning trails in digraphs
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- On improving matchings in trees, via bounded-length augmentations
- Erdős-Ko-Rado for perfect matchings
- Forbidden subgraphs and the König-Egerváry property
- Augmenting trail theorem for the maximum 1-2 matching problem
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
- A (3+)k-vertex kernel for edge-disjoint triangle packing
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Stabilizing network bargaining games by blocking players
- On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
- ``Global graph problems tend to be intractable
- A polynomial time solvable instance of the feasible minimum cover problem
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- The matching-connectivity of a graph
- Tight bounds on maximal and maximum matchings
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
- On finding augmenting graphs
- Gallai-Edmonds decomposition as a pruning technique
- Augmenting chains in graphs without a skew star.
- New approximation results on graph matching and related problems
- Finding a maximum matching in a permutation graph
- Linear-time certifying algorithms for near-graphical sequences
- scientific article; zbMATH DE number 7651215 (Why is no real title available?)
- From matchings to independent sets
- On maximal independent sets of vertices in claw-free graphs
- Sparse regular induced subgraphs in \(2P_3\)-free graphs
- Combinatorics and algorithms for augmenting graphs
- Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs
- Priority matchings revisited
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
- Supereulerian graphs with constraints on the matching number and minimum degree
- Cardinality of relations with applications
- The combinatorics of N. G. de Bruijn
- Independence and matching numbers of unicyclic graphs from null space
- Nonconvergence, undecidability, and intractability in asymptotic problems
- Matching theory -- a sampler: From Dénes König to the present
- Stabilizing maximum matching in bipartite networks
- Matchings in graphs. II
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Some results on Berge's conjecture and begin-end conjecture
- Condensed Ricci curvature of complete and strongly regular graphs
- Dynamic Matching Algorithms in Practice
- Implicit computation of maximum bipartite matchings by sublinear functional operations
- On matching cover of graphs
- Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Generalized XOR non-locality games with graph description on a square lattice
- PARALLEL APPROXIMATE MATCHING
- The general maximum matching algorithm of Micali and Vazirani
- On an interpolation property of outerplanar graphs
- Dynamic matchings in left vertex weighted convex bipartite graphs
- A formal correctness proof of Edmonds' blossom shrinking algorithm
- The support unit location problem to road traffic surveys with multi-stages
- Converting triangulations to quadrangulations
- An extension of matching theory
- On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
- Maximum fractional factors in graphs
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
- M-alternating Hamilton paths and M-alternating Hamilton cycles
- Composability and controllability of structural linear time-invariant systems: distributed verification
- State-of-the-art sparse direct solvers
- scientific article; zbMATH DE number 7561360 (Why is no real title available?)
- scientific article; zbMATH DE number 7561384 (Why is no real title available?)
This page was built for publication: TWO THEOREMS IN GRAPH THEORY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3258697)
