Pages that link to "Item:Q1357740"
From MaRDI portal
The following pages link to Coloured matchings in bipartite graphs (Q1357740):
Displaying 14 items.
- Maximum transversal in partial Latin squares and rainbow matchings (Q869577) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- Matchings in colored bipartite networks (Q1613406) (← links)
- Bottleneck subset-type restricted matching problems (Q2023130) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Maximum weight edge-constrained matchings (Q2476253) (← links)
- (Q3011793) (← links)
- Random Bichromatic Matchings (Q3525759) (← links)
- A note on the hardness results for the labeled perfect matching problems in bipartite graphs (Q3598040) (← links)
- A weighted perfect matching with constraints on weights of its parts (Q5100129) (← links)
- Bicolored matchings in some classes of graphs (Q5899324) (← links)