scientific article; zbMATH DE number 5016662
From MaRDI portal
Publication:3378287
Recommendations
- Strong matching preclusion
- Conditional matching preclusion sets
- Matching preclusion and conditional matching preclusion for dual-cubes
- Perfect matchings and applications
- On an obstruction for perfect matchings
- Matching preclusion number of graphs
- Matching Preclusion for the Shuffle-Cubes
- Matching preclusion number in product graphs
- Matching preclusion and conditional matching preclusion for crossed cubes
Cited in
(74)- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Strong matching preclusion number of graphs
- On the perfect matching graph defined by a set of cycles
- Strong matching preclusion for \(k\)-composition networks
- Matching preclusion number of graphs
- Matching preclusion number in product graphs
- Matching preclusion for n-grid graphs
- Matching preclusion for balanced hypercubes
- Strong matching preclusion under the conditional fault model
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- Matching preclusion for k-ary n-cubes with odd k 3
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- Fractional matching preclusion number of graphs
- Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
- The fractional matching preclusion number of complete n-balanced k-partite graphs
- A note on the strong matching preclusion problem for data center networks
- Fractional matching preclusion of product networks
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- A note on generalized matching preclusion in bipartite graphs
- Fractional matching preclusion of the restricted HL-graphs
- Matching preclusion for direct product of regular graphs
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Fractional matching preclusion for arrangement graphs
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion for cube-connected cycles
- Subnetwork preclusion for bubble-sort networks
- Matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for non-bipartite torus networks
- Fractional matching preclusion of graphs
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- The (conditional) matching preclusion for burnt pancake graphs
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Conditional fractional matching preclusion of \(n\)-dimensional torus networks
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- Strong matching preclusion for \(n\)-dimensional torus networks
- Matching preclusion for vertex-transitive networks
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
- Perfect matchings in grid graphs after vertex deletions
- Strong matching preclusion for augmented cubes
- Strong matching preclusion for torus networks
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching Preclusion for the Shuffle-Cubes
- A short note of strong matching preclusion for a class of arrangement graphs
- Fractional matching preclusion for data center networks
- Fractional Strong Matching Preclusion for DHcube
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for (n,k)-star graphs
- How to Secure Matchings Against Edge Failures
- How to Secure Matchings against Edge Failures
- Fractional matching preclusion for radix triangular mesh
- Matching preclusion of the generalized Petersen graph
- Matching preclusion of boxdot products
- On anti-Kekulé and s-restricted matching preclusion problems
- Conditional matching preclusion number of graphs
- Perfect matchings in graphs with prescribed local restrictions
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Fractional matching preclusion numbers of Cartesian product graphs
- Integer \(k\)-matching preclusion of some interconnection networks
- Conditional matching preclusion for the arrangement graphs
- Strong matching preclusion
- Conditional \(k\)-matching preclusion for \(n\)-dimensional torus networks
- Integer k-matching preclusion of graphs
- The d-blocker number and d-transversal number of hexagonal systems
- Conditional matching preclusion of enhanced hypercubes
- Strong matching preclusion for folded hypercubes
- Higher order matching preclusion for regular interconnection networks
- Conditional fractional matching preclusion number of graphs
- On the d-blocker number of k-ary n-cubes
- Note on matching preclusion number of random graphs
- On an obstruction for perfect matchings
- Strong matching preclusion of (n,k)-star graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378287)
