scientific article
From MaRDI portal
Publication:3378287
zbMath1091.05057MaRDI QIDQ3378287
Robert C. Brigham, Elizabeth C. Violin, Jay E. Yellen, Frank Harary
Publication date: 30 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (59)
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 ⋮ The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Strong matching preclusion for non-bipartite torus networks ⋮ Conditional fractional matching preclusion of \(n\)-dimensional torus networks ⋮ 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 ⋮ Fractional matching preclusion of graphs ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Strong matching preclusion for augmented cubes ⋮ Strong matching preclusion for torus networks ⋮ Matching preclusion for balanced hypercubes ⋮ On anti-Kekulé and \(s\)-restricted matching preclusion problems ⋮ Conditional matching preclusion number of graphs ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ Strong matching preclusion number of graphs ⋮ Strong matching preclusion for \(k\)-composition networks ⋮ Integer \(k\)-matching preclusion of some interconnection networks ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ A note on the strong matching preclusion problem for data center networks ⋮ Strong matching preclusion under the conditional fault model ⋮ Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract) ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products ⋮ Fractional matching preclusion of product networks ⋮ Matching preclusion number of graphs ⋮ The (conditional) matching preclusion for burnt pancake graphs ⋮ Strong matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Conditional matching preclusion for the arrangement graphs ⋮ Strong matching preclusion ⋮ Matching preclusion number in product graphs ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ How to Secure Matchings against Edge Failures ⋮ Matching preclusion for \(n\)-grid graphs ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\) ⋮ A note on generalized matching preclusion in bipartite graphs ⋮ Conditional matching preclusion for regular bipartite graphs and their Cartesian product ⋮ Fractional matching preclusion of the restricted HL-graphs ⋮ Fractional matching preclusion for radix triangular mesh ⋮ Conditional matching preclusion sets ⋮ Matching preclusion for direct product of regular graphs ⋮ Fractional matching preclusion number of graphs and the perfect matching polytope ⋮ How to Secure Matchings Against Edge Failures ⋮ Conditional matching preclusion for hypercube-like interconnection networks ⋮ Fractional matching preclusion number of graphs ⋮ Note on matching preclusion number of random graphs ⋮ Fractional matching preclusion for arrangement graphs ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star 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
This page was built for publication:
