Pages that link to "Item:Q2410255"
From MaRDI portal
The following pages link to Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs (Q2410255):
Displaying 10 items.
- Note on matching preclusion number of random graphs (Q784472) (← links)
- Matching preclusion number in product graphs (Q1725689) (← links)
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product (Q2028067) (← links)
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs (Q2165283) (← links)
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph (Q2238215) (← links)
- A note on generalized matching preclusion in bipartite graphs (Q2272412) (← links)
- Matching preclusion for direct product of regular graphs (Q2306600) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- On anti-Kekulé and \(s\)-restricted matching preclusion problems (Q6039537) (← links)
- Fractional matching preclusion numbers of Cartesian product graphs (Q6110597) (← links)
