The following pages link to (Q5520564):
Displaying 50 items.
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Altruistically unbalanced kidney exchange (Q403725) (← links)
- Remarks on a conjecture of Barát and Tóth (Q405159) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Kidney exchange: an egalitarian mechanism (Q533096) (← links)
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (Q641542) (← links)
- Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- Finite dualities and map-critical graphs on a fixed surface (Q765196) (← links)
- Spectral aspects of symmetric matrix signings (Q783041) (← 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)
- Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
- How (not) to integrate blood subtyping technology to kidney exchange (Q1757567) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Toughness and matching extension in graphs (Q1824634) (← links)
- A generalisation of matching and colouring (Q1877669) (← links)
- Dispersing obnoxious facilities on a graph (Q2032349) (← links)
- Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704) (← links)
- Kidney exchange with immunosuppressants (Q2059051) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- A refined Gallai-Edmonds structure theorem for weighted matching polynomials (Q2111908) (← links)
- Continuous facility location on graphs (Q2118124) (← links)
- On the dichromatic number of surfaces (Q2121762) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) (Q2161276) (← links)
- The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
- Irreducible decomposition of powers of edge ideals (Q2178508) (← links)
- Generalized hypergraph coloring (Q2214310) (← links)
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem (Q2288180) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- Bounded clique cover of some sparse graphs (Q2359963) (← links)
- On DP-coloring of graphs and multigraphs (Q2360256) (← links)
