Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Matching preclusion
open-in-new
<h2 id="references">References</h2> <ol> <li id="fn:1"><p>Brigham, Robert C.; Harary, Frank; Violin, Elizabeth C.; Yellen, Jay (2005), "Perfect-matching preclusion", Congressus Numerantium, 174, Utilitas Mathematica Publishing, Inc.: 185–192. <a href="/wiki/Frank_Harary" target="_blank">/wiki/Frank_Harary</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Cheng, Eddie; Lipták, László (2007), "Matching preclusion for some interconnection networks", Networks, 50 (2): 173–180, doi:10.1002/net.20187. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Cheng, Eddie; Lipták, László (2007), "Matching preclusion for some interconnection networks", Networks, 50 (2): 173–180, doi:10.1002/net.20187. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Cheng, Eddie; Lesniak, Linda; Lipman, Marc J.; Lipták, László (2009), "Conditional matching preclusion sets", Information Sciences, 179 (8): 1092–1101, doi:10.1016/j.ins.2008.10.029. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Park, Jung-Heum; Son, Sang Hyuk (2009), "Conditional matching preclusion for hypercube-like interconnection networks", Theoretical Computer Science, 410 (27–29): 2632–2640, doi:10.1016/j.tcs.2009.02.041. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Lacroix, Mathieu; Ridha Mahjoub, A.; Martin, Sébastien; Picouleau, Christophe (March 2012). "On the NP-completeness of the perfect matching free subgraph problem". Theoretical Computer Science. 423: 25–29. doi:10.1016/j.tcs.2011.12.065. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Dourado, Mitre Costa; Meierling, Dirk; Penso, Lucia D.; Rautenbach, Dieter; Protti, Fabio; de Almeida, Aline Ribeiro (2015), "Robust recoverable perfect matchings", Networks, 66 (3): 210–213, doi:10.1002/net.21624. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Mao, Yaping; Wang, Zhao; Cheng, Eddie; Melekian, Christopher (2018), "Strong matching preclusion number of graphs", Theoretical Computer Science, 713: 11–20, doi:10.1016/j.tcs.2017.12.035. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> </ol>