Note on matching preclusion number of random graphs
type: Item
instance of: scholarly article
title: Note on matching preclusion number of random graphs
zbMATH Open document ID: 1453.05101
author: Ran Gu
author: Yaping Mao
author: Guoju Ye
published in: Theoretical Computer Science
publication date: 2020-08-03T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 7226867
zbMATH Keywords: perfect matching
zbMATH Keywords: matching preclusion number
zbMATH Keywords: random graph
MaRDI profile type: Publication
full work available at URL: j.tcs.2019.12.011
OpenAlex ID: W2996548529
cites work: Paths in graphs
cites work: Q3258698
cites work: Q3720644
cites work: Q3378287
cites work: On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
cites work: Q5422499
cites work: Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
cites work: MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
cites work: Matching preclusion for some interconnection networks
cites work: Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
cites work: Matching preclusion and conditional matching preclusion for regular interconnection networks
cites work: On two Hamilton cycle problems in random graphs
cites work: On packing Hamilton cycles in \(\varepsilon\)-regular graphs
cites work: Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
cites work: Edge-disjoint Hamilton cycles in random graphs
cites work: Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
cites work: Hamilton decompositions of regular expanders: applications
cites work: Optimal Packings of Hamilton Cycles in Sparse Random Graphs
DOI: 10.1016/J.TCS.2019.12.011
description: scientific article; zbMATH DE number 7226867