The following pages link to Alternating cycle-free matchings (Q1325959):
Displaying 20 items.
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (Q1270816) (← links)
- Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Positive matching decompositions of graphs (Q2166243) (← links)
- Connected matchings in chordal bipartite graphs (Q2339830) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- On unicyclic graphs with uniquely restricted maximum matchings (Q2637732) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- Unicycle graphs and uniquely restricted maximum matchings (Q3439344) (← links)
- (Q4691855) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- The difficulty of beating the Taxman (Q6064847) (← links)
