scientific article; zbMATH DE number 3220175

Cited in

(73)

Good characterizations for some degree constrained subgraphs
Packing trees with constraints on the leaf degree
Random assignment under weak preferences
Bounding the size of equimatchable graphs of fixed genus
Ear-decompositions of matching-covered graphs
The Edmonds-Gallai decomposition for matchings in locally finite graphs
Brick decompositions and the matching rank of graphs
Maximal tight sets and the Edmonds-Gallai decomposition for matchings
Undirected distances and the postman-structure of graphs
f-factors and related decompositions of graphs
A structure theorem for maximum internal matchings in graphs
Matching theory -- a sampler: From Dénes König to the present
On the linear k-arboricity of cubic graphs
Bargaining in a network of buyers and sellers.
A 2-approximation algorithm for the minimum weight edge dominating set problem
Maximum matchings in regular graphs
How (not) to integrate blood subtyping technology to kidney exchange
Toughness and matching extension in graphs
On the factorization of graphs with exactly one vertex of infinite degree
On the number of 1-factors of locally finite graphs
A generalisation of matching and colouring
On characterizing the critical graphs for matching Ramsey numbers
Dispersing obnoxious facilities on a graph
Kidney exchange with immunosuppressants
Graft analogue of general Kotzig-Lovász decomposition
Maximum matching in almost linear time on graphs of bounded clique-width
On maximum matchings in 5-regular and 6-regular multigraphs
Continuous facility location on graphs
Co-density and fractional edge cover packing
An Edmonds-Gallai-type decomposition for the $j$-restricted $k$-matching problem
On the König deficiency of zero-reducible graphs
Decomposition theorems for square-free 2-matchings in bipartite graphs
Additive stabilizers for unstable graphs
Independence and matching number in graphs with maximum degree 4
Second kind maximum matching graph
Kidney exchange: further utilization of donors via listed exchange
A $\frac{1}{2}$-integral relaxation for the $A$-matching problem
Packing non-returning $A$-paths algorithmically
A modified greedy algorithm for dispersively weighted 3-set cover
Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen
Gallai-Edmonds decomposition as a pruning technique
A hypergraph version of the Gallai-Edmonds Theorem
scientific article; zbMATH DE number 3679881 (Why is no real title available?)
Altruistically unbalanced kidney exchange
Independent sets and matchings in subcubic graphs
Packing $k$-Matchings and $k$-Critical Graphs
Graph stabilization: a survey
Per-spectral characterizations of graphs with extremal per-nullity
Continuous facility location on graphs
Efficient stabilization of cooperative matching games
Kidney exchange: an egalitarian mechanism
Popular matchings with ties and matroid constraints
The factorization of graphs. II
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
On the maximum even factor in weakly symmetric graphs
Induced graph packing problems
A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
Cup stacking in graphs
A note on the stability results of the number of cliques in graphs with given matching number
Basilica: new canonical decomposition in matching theory
On the Kőnig-Egerváry index of a graph
Total coloring graphs with large maximum degree
Approximating -covering
Regularity of normal Rees algebras of edge ideals of graphs
Proportional representation in matching markets: selecting multiple matchings under dichotomous preferences
The complexity of pre-assignment problem for unique minimum vertex cover on bipartite graphs
Quasipolynomial-time deterministic kernelization and (gammoid) representation
New structural bounds for $\operatorname{ker}(G)$ and $\operatorname{core}(G)$
Spectral aspects of symmetric matrix signings
Pairwise kidney exchange
Approximation of satisfactory bisection problems
Elementary graphs with respect to $f$-parity factors
Satisfactory graph partition, variants, and generalizations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5508779)