Note on matching preclusion number of random graphs
From MaRDI portal
Publication:784472
DOI10.1016/J.TCS.2019.12.011zbMATH Open1453.05101OpenAlexW2996548529MaRDI QIDQ784472FDOQ784472
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
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Paths in graphs
- Title not available (Why is that?)
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion for some interconnection networks
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamilton decompositions of regular expanders: applications
- Edge-disjoint Hamilton cycles in random graphs
- Title not available (Why is that?)
- Optimal packings of Hamilton cycles in sparse random graphs
- On two Hamilton cycle problems in random graphs
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
Cited In (3)
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)
