Matching preclusion of the generalized Petersen graph

DOI10.20429/TAG.2019.060105MaRDI QIDQ5205654zbMATH OpenOpenAlexWikidataFDO

Authors Ajay Arora, Eddie Cheng, Christopher Melekian

Publication date 13 December 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2019.060105

zbMATH Keywords

generalized Petersen graphperfect matchingPetersen graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph P(n,3)
• Strong matching preclusion of the generalized Petersen graph
• scientific article; zbMATH DE number 5016662
• Matching preclusion number of graphs
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube

Cited in

(11)

• Matching preclusion number of graphs
• Matching preclusion for n-grid graphs
• A note on generalized matching preclusion in bipartite graphs
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• The (conditional) matching preclusion for burnt pancake graphs
• A note on the conditional matching preclusion problem of the folded Petersen cube
• Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph P(n,3)
• Strong matching preclusion of the generalized Petersen graph
• Matching preclusion of boxdot products
• Generalized Matching Preclusion in Bipartite Graphs
• Note on matching preclusion number of random graphs

This page was built for publication: Matching preclusion of the generalized Petersen graph

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