Pages that link to "Item:Q5899324"
From MaRDI portal
The following pages link to Bicolored matchings in some classes of graphs (Q5899324):
Displaying 17 items.
- Subset matching and edge coloring in bipartite graphs (Q510962) (← links)
- Addendum to ``Bicolored matchings in some classes of graphs'' (Q937244) (← links)
- Blockers and transversals (Q1043948) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- Coloured matchings in bipartite graphs (Q1357740) (← links)
- Matchings in colored bipartite networks (Q1613406) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- On trees with a maximum proper partial 0-1 coloring containing a maximum matching (Q2368934) (← links)
- Random bichromatic matchings (Q2482731) (← links)
- On the basis graph of a bicolored matroid (Q2840548) (← links)
- Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\) (Q2892425) (← 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)
- Exact Perfect Matching in Complete Graphs (Q4973885) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902507) (← links)