Matching preclusion for \(n\)-grid graphs
From MaRDI portal
Publication:1752462
DOI10.1016/j.dam.2018.02.012zbMath1387.05195arXiv1609.07207OpenAlexW2527328599MaRDI QIDQ1752462
Hui Zhou, Qi Ding, Heping Zhang
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.07207
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Construction of k-matchings in graph products ⋮ On anti-Kekulé and \(s\)-restricted matching preclusion problems ⋮ Matching preclusion for \(n\)-grid graphs
Cites Work
- Matching preclusion for vertex-transitive 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 \(k\)-ary \(n\)-cubes
- Conditional matching preclusion sets
- Matching preclusion for \(n\)-grid graphs
- Matching preclusion for balanced hypercubes
- The (conditional) matching preclusion for burnt pancake graphs
- 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
- Conditional matching preclusion for the alternating group graphs and split-stars
- Matching preclusion for the (n, k)-bubble-sort graphs
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Matching preclusion for some interconnection networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Matching preclusion for \(n\)-grid graphs
