Note on matching preclusion number of random graphs

DOI10.1016/J.TCS.2019.12.011MaRDI QIDQ784472zbMATHOpenAlexFDO

Authors Ran Gu, Yaping Mao, Guoju Ye

Publication date 3 August 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2019.12.011

zbMATH Keywords

random graphperfect matchingmatching preclusion number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Matching preclusion number of graphs
• scientific article; zbMATH DE number 5016662
• Matching preclusion of the generalized Petersen graph
• Matching preclusion for some interconnection networks
• Matching preclusion of boxdot products

Cites work

• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• scientific article; zbMATH DE number 3950585 (Why is no real title available?)
• Edge-disjoint Hamilton cycles in random graphs
• Graph theory
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Hamilton decompositions of regular expanders: applications
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for some interconnection networks
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs
• On two Hamilton cycle problems in random graphs
• Optimal packings of Hamilton cycles in sparse random graphs
• Paths in graphs

Cited in

(3)

• Matching preclusion number of graphs
• Conditional matching preclusion for regular bipartite graphs and their Cartesian product
• Perfect matchings in random octagonal chain graphs

This page was built for publication: Note on matching preclusion number of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784472)