The following pages link to (Q5520564):
Displayed 23 items.
- Kidney exchange: an egalitarian mechanism (Q533096) (← links)
- Minimal connected \(\tau\)-critical hypergraphs (Q855295) (← links)
- Random assignment under weak preferences (Q1021614) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- Bounding the size of equimatchable graphs of fixed genus (Q1043800) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- The enumeration problem for color critical linear hypergraphs (Q1144047) (← links)
- A structure theorem for maximum internal matchings in graphs (Q1183490) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- On the linear \(k\)-arboricity of cubic graphs (Q1356680) (← links)
- The colour theorems of Brooks and Gallai extended (Q1356682) (← links)
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
- On the triangle vertex Folkman numbers (Q1408894) (← links)
- Critical graphs with connected complements (Q1417962) (← links)
- Bargaining in a network of buyers and sellers. (Q1427496) (← links)
- Colour-critical graphs with few edges (Q1584424) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Toughness and matching extension in graphs (Q1824634) (← links)
- A generalisation of matching and colouring (Q1877669) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- A hypergraph version of the Gallai-Edmonds Theorem (Q3439610) (← links)
- On Ramsey minimal graphs (Q5917560) (← links)