Pages that link to "Item:Q1725689"
From MaRDI portal
The following pages link to Matching preclusion number in product graphs (Q1725689):
Displayed 10 items.
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product (Q2028067) (← links)
- A note on maximum fractional matchings of graphs (Q2075471) (← links)
- Fractional matching preclusion number of graphs (Q2078848) (← links)
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs (Q2165283) (← links)
- Fractional matching preclusion of product networks (Q2210501) (← links)
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph (Q2238215) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- Construction of k-matchings in graph products (Q5058206) (← links)
- Conditional matching preclusion number of graphs (Q6045913) (← links)
- Fractional matching preclusion numbers of Cartesian product graphs (Q6110597) (← links)