Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,935,582 papers from all fields of science
Search
Sign In
Create Free Account
Matching preclusion
In graph theory, a branch of mathematics, the matching preclusion number of a graph G (denoted mp(G)) is the minimum number of edges whose deletion…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Circuit rank
Degree (graph theory)
Distributed algorithm
Dulmage–Mendelsohn decomposition
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Matching Preclusion of the Generalized Petersen Graph
Ajay Arora
,
E. Cheng
,
Christopher Melekian
Theory and Applications of Graphs
2019
Corpus ID: 155197251
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results…
Expand
2019
2019
Fractional Strong Matching Preclusion of Split-Star Networks
Ping Han
,
Yuzhi Xiao
,
Chengfu Ye
,
He Li
Journal of Mathematics Research
2019
Corpus ID: 199589975
The matching preclusion number of graph G is the minimum size of edges whose deletion leaves the resulting graph without a…
Expand
2014
2014
Putting the “Uniform” Back in the Securities Litigation Uniform Standards Act of 1998: The Case for Employing a Reasonable Relationship Approach
Christopher R. Bellacicco
2014
Corpus ID: 59042808
2013
2013
Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks
Aline Ribeiro de Almeida
,
F. Protti
,
L. Markenzon
Ars Comb.
2013
Corpus ID: 18748395
The matching preclusion number of a graph G, mp(G), is the minimum number of edges whose deletion leaves a resulting graph that…
Expand
2010
2010
Matching Preclusion and Conditional Matching Preclusion Problems for Twisted Cubes
R. Bhaskar
,
E. Cheng
,
Mason Liang
,
S. Pandey
,
Ke Wang
2010
Corpus ID: 9560470
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither…
Expand
Review
2006
Review
2006
You Can Check Out But You Can Never Leave: The Story of San Remo Hotel -- The Supreme Court Relegates Federal Takings Claims to State Courts Under a Rule Intended to Ripen the Claims for Federal…
J. Breemer
2006
Corpus ID: 153614597
On June 20, 2005, the Supreme Court of the United States issued its decision in San Remo Hotel, L.P. v. City of San Francisco…
Expand
2002
2002
A Study on the Collateral Estoppel(Issue Preclusion) of Former Adjudication
權赫宰
2002
Corpus ID: 159646569
2001
2001
Hypothetical Jurisdiction and Interjurisdictional Preclusion: A "Comity" of Errors
Ely Todd Chayet
2001
Corpus ID: 222886035
1992
1992
For One Litigant’s Sole Relief: Unforeseeable Preclusion and the Second Restatement
R. Ziff
1992
Corpus ID: 59129489
Review
1992
Review
1992
Rethinking Arbitral Preclusion
Gerard J. Sanders
1992
Corpus ID: 151145606
1. Introduction This Article is about the theory of arbitral preclusion. Its focus is on an aspect of the relationship between…
Expand