Matching preclusion number of graphs
DOI10.1016/j.tcs.2019.01.005zbMath1410.68308arXiv1808.10443OpenAlexW2888928036MaRDI QIDQ1711840
Jinyu Zou, Eddie Cheng, Yaping Mao, Zhao Wang
Publication date: 18 January 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.10443
interconnection networksperfect matchingextremal problemNordhaus-Gaddum problemmatching preclusion number
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the NP-completeness of the perfect matching free subgraph problem
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Strong matching preclusion
- Conditional matching preclusion for hypercube-like interconnection networks
- Strong matching preclusion number of graphs
- A survey of Nordhaus-Gaddum type relations
- Strong matching preclusion under the conditional fault model
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- 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
- Matching preclusion for the (n, k)-bubble-sort graphs
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Matching preclusion for some interconnection networks
- The Factorization of Linear Graphs
This page was built for publication: Matching preclusion number of graphs
