Strong matching preclusion
From MaRDI portal
Publication:653338
DOI10.1016/J.TCS.2011.08.008zbMATH Open1232.05186OpenAlexW2007968776MaRDI QIDQ653338FDOQ653338
Authors: Jung-Heum Park, Insung Ihm 
Publication date: 9 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.008
Recommendations
Cites Work
- Graph theory
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Recursive circulants and their embeddings among hypercubes
- Title not available (Why is that?)
- Matching preclusion for some interconnection networks
- Graph Bipartization and via minimization
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Perfect matchings after vertex deletions
- Perfect matchings in pruned grid graphs
- Conditional matching preclusion for the alternating group graphs and Split-stars
- On Trivalent Graphs
Cited In (38)
- Conditional matching preclusion for the arrangement graphs
- Fractional matching preclusion number of graphs
- Fractional matching preclusion for \((n,k)\)-star graphs
- Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
- Strong matching preclusion of 2-matching composition networks
- Fractional matching preclusion of graphs
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- Title not available (Why is that?)
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Strong matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for two-dimensional torus networks
- Strong matching preclusion for augmented cubes
- Strong matching preclusion for torus networks
- Conditional strong matching preclusion of the alternating group graph
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Strong matching preclusion of \((n,k)\)-star graphs
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for arrangement graphs
- A note on generalized matching preclusion in bipartite graphs
- Integer \(k\)-matching preclusion of some interconnection networks
- Matching preclusion for balanced hypercubes
- Strong matching preclusion for \(k\)-composition networks
- Matching preclusion number of graphs
- Robust recoverable perfect matchings
- Strong matching preclusion under the conditional fault model
- Conditional matching preclusion number of graphs
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Fractional matching preclusion for radix triangular mesh
- Fractional Strong Matching Preclusion for DHcube
- Strong matching preclusion number of graphs
- Minimum \(k\)-critical bipartite graphs
- Integer \(k\)-matching preclusion of graphs
- Fractional matching preclusion of the restricted HL-graphs
- Strong matching preclusion of the generalized Petersen graph
- A short note of strong matching preclusion for a class of arrangement graphs
- A note on the strong matching preclusion problem for data center networks
- Strong matching preclusion for non-bipartite torus networks
This page was built for publication: Strong matching preclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653338)
