scientific article; zbMATH DE number 3220175
From MaRDI portal
Publication:5508779
zbMath0135.42001MaRDI QIDQ5508779
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A generalisation of matching and colouring, Continuous Facility Location on Graphs, Maximal tight sets and the Edmonds-Gallai decomposition for matchings, Gallai-Edmonds decomposition as a pruning technique, Undirected distances and the postman-structure of graphs, On the linear \(k\)-arboricity of cubic graphs, On the maximum even factor in weakly symmetric graphs, Co-density and fractional edge cover packing, Induced graph packing problems, Decomposition theorems for square-free 2-matchings in bipartite graphs, Unnamed Item, Additive stabilizers for unstable graphs, Altruistically unbalanced kidney exchange, Popular Matchings with Ties and Matroid Constraints, Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen, f-factors and related decompositions of graphs, The factorization of graphs. II, Packing $k$-Matchings and $k$-Critical Graphs, Independent sets and matchings in subcubic graphs, A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem, Maximum matchings in regular 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, Bargaining in a network of buyers and sellers., Approximation of satisfactory bisection problems, A structure theorem for maximum internal matchings in graphs, Per-spectral characterizations of graphs with extremal per-nullity, A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem, Matching theory -- a sampler: From Dénes König to the present, Packing non-returning \(A\)-paths algorithmically, Efficient stabilization of cooperative matching games, How (not) to integrate blood subtyping technology to kidney exchange, Kidney exchange: an egalitarian mechanism, On characterizing the critical graphs for matching Ramsey numbers, Elementary graphs with respect to \(f\)-parity factors, Satisfactory graph partition, variants, and generalizations, A modified greedy algorithm for dispersively weighted 3-set cover, Graph Stabilization: A Survey, Dispersing obnoxious facilities on a graph, An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem, Good characterizations for some degree constrained subgraphs, On the König deficiency of zero-reducible graphs, Packing trees with constraints on the leaf degree, Random assignment under weak preferences, Kidney exchange with immunosuppressants, Toughness and matching extension in graphs, On the factorization of graphs with exactly one vertex of infinite degree, Graft analogue of general Kotzig-Lovász decomposition, Bounding the size of equimatchable graphs of fixed genus, Spectral aspects of symmetric matrix signings, On the number of 1-factors of locally finite graphs, Ear-decompositions of matching-covered graphs, The Edmonds-Gallai decomposition for matchings in locally finite graphs, Maximum matching in almost linear time on graphs of bounded clique-width, Brick decompositions and the matching rank of graphs, On maximum matchings in 5-regular and 6-regular multigraphs, Unnamed Item, A hypergraph version of the Gallai-Edmonds Theorem, A 2-approximation algorithm for the minimum weight edge dominating set problem, Pairwise kidney exchange, Continuous facility location on graphs