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