The following pages link to (Q4871750):
Displaying 34 items.
- Matchings, path covers and domination (Q329554) (← links)
- Induced cycles in graphs (Q503635) (← links)
- Popular matchings with variable item copies (Q631788) (← links)
- Incremental assignment problem (Q865928) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Bounds relating the weakly connected domination number to the total domination number and the matching number (Q967362) (← links)
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437) (← links)
- On mod \((2p+1)\)-orientations of graphs (Q1003841) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Perfect matchings and ears in elementary bipartite graphs (Q1377683) (← links)
- Rank-maximal matchings -- structure and algorithms (Q1733053) (← links)
- Metabolic networks are NP-hard to reconstruct (Q1797721) (← links)
- Reduced 2-to-1 maps and decompositions of graphs with no 2-to-1 cut sets (Q1862028) (← links)
- Guarding disjoint triangles and claws in the plane (Q1873155) (← links)
- Popularity at minimum cost (Q2015798) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) (← links)
- Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Systems of distant representatives in Euclidean space (Q2347967) (← links)
- Dynamic rank-maximal and popular matchings (Q2420654) (← links)
- On matching and semitotal domination in graphs (Q2440939) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- The Generalized Popular Condensation Problem (Q2942664) (← links)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties (Q3448799) (← links)
- (Q4635970) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties (Q5371030) (← links)
- Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
