X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1903) 1903
Publication (187) 187
Conference Proceeding (137) 137
Book Chapter (41) 41
Book / eBook (17) 17
Dissertation (17) 17
Paper (10) 10
Magazine Article (4) 4
Newspaper Article (4) 4
Book Review (1) 1
Government Document (1) 1
Reference (1) 1
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
perfect matching (632) 632
mathematics (545) 545
perfect matchings (400) 400
mathematics, applied (384) 384
graphs (293) 293
algorithms (170) 170
matching (158) 158
economics (153) 153
computer science (152) 152
physics (136) 136
analysis (134) 134
graph theory (127) 127
materials science, multidisciplinary (124) 124
mathematics, interdisciplinary applications (122) 122
studies (116) 116
optics (114) 114
combinatorics (109) 109
computer science, theory & methods (107) 107
chemistry, multidisciplinary (105) 105
discrete mathematics and combinatorics (104) 104
mathematical analysis (101) 101
perfect absorber (101) 101
metamaterials (90) 90
bargaining theory, matching theory (89) 89
mathematical models (89) 89
bargaining (87) 87
engineering, electrical & electronic (87) 87
physics, applied (87) 87
absorption (86) 86
number (80) 80
theoretical computer science (80) 80
equilibrium (79) 79
games (76) 76
physics, multidisciplinary (75) 75
computer science, interdisciplinary applications (74) 74
optimization (68) 68
chemistry (66) 66
metamaterial (66) 66
game theory (64) 64
absorber (63) 63
mathematics - combinatorics (63) 63
nanoscience & nanotechnology (63) 63
trees (63) 63
statistics & probability (59) 59
bipartite graphs (55) 55
bipartite graph (54) 54
research (53) 53
economic theory (51) 51
computer science, software engineering (50) 50
enumeration (50) 50
perfect equilibrium (50) 50
astronomy & astrophysics (49) 49
algorithm (48) 48
design (48) 48
discrete mathematics (48) 48
hexagonal systems (48) 48
broadband (46) 46
absorbers (45) 45
applied mathematics (45) 45
model (45) 45
operations research & management science (44) 44
plasmonics (44) 44
information (43) 43
social sciences, mathematical methods (42) 42
tree (42) 42
general relativity and quantum cosmology (40) 40
physical chemistry (40) 40
polynomials (40) 40
theory of computation (40) 40
chemistry, physical (39) 39
perfect competition (39) 39
complexity (38) 38
matchings (38) 38
models (38) 38
theoretical and computational chemistry (38) 38
usage (38) 38
graphene (37) 37
light (37) 37
math. applications in chemistry (37) 37
convex and discrete geometry (36) 36
economic models (36) 36
general-relativity (36) 36
index medicus (36) 36
physics, particles & fields (36) 36
computational theory and mathematics (35) 35
computer simulation (35) 35
perfect (35) 35
perfect absorption (35) 35
computer science, information systems (34) 34
operations research/decision theory (34) 34
quantum physics (34) 34
05c70 (32) 32
multidisciplinary sciences (32) 32
perfect fluid (32) 32
systems (32) 32
uniform hypergraphs (32) 32
z-transformation graphs (32) 32
broad-band (31) 31
engineering design (31) 31
nanotechnology (30) 30
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (2077) 2077
Japanese (10) 10
Chinese (7) 7
French (3) 3
Croatian (2) 2
Czech (1) 1
German (1) 1
Indonesian (1) 1
Korean (1) 1
Russian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Mathematics, ISSN 0012-365X, 06/2019, Volume 342, Issue 6, pp. 1731 - 1737
A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. We use E3(2d−1,n−2d+1) to denote the 3-uniform hypergraph whose vertex set can be... 
Matching | 3-uniform hypergraph | Adjacent vertices | HAMILTON CYCLES | MATHEMATICS | PERFECT MATCHINGS | THEOREM | MINIMUM DEGREE THRESHOLDS | ERDOS | UNIFORM HYPERGRAPHS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2016, Volume 615, pp. 91 - 101
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect... 
[formula omitted]-star graphs | Perfect matching | Almost perfect matching | (n, k)-star graphs | FAULT HAMILTONICITY | COMPUTER SCIENCE, THEORY & METHODS | ALTERNATING GROUP GRAPHS | Matching | Stars | Deletion | Graphs | Graph theory | Parks | Optimization
Journal Article
Information Sciences, ISSN 0020-0255, 2009, Volume 179, Issue 8, pp. 1092 - 1101
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor... 
Hypercubes | Perfect matching | Almost-perfect matching | Interconnection networks | COMPUTER SCIENCE, INFORMATION SYSTEMS | NETWORKS | FOLDED HYPERCUBES
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 11/2018, Volume 34, Issue 6, pp. 1333 - 1346
We derive a simple bijection between geometric plane perfect matchings on 2n points in convex position and triangulations on n + 2 points in convex position.... 
Temperley–Lieb algebras | Triangulations | Fuss–Catalan algebras | Perfect matchings | MATHEMATICS | MODELS | Temperley-Lieb algebras | Fuss-Catalan algebras | FUSS | Algebra | Apexes
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2011, Volume 412, Issue 45, pp. 6409 - 6419
The matching preclusion problem, introduced by Brigham et al. [R.C. Brigham, F. Harary, E.C. Violin, and J. Yellen, Perfect-matching preclusion, Congressus... 
Perfect and almost perfect matching | Matching preclusion | Recursive circulant | Restricted hypercube-like graph | Vertex and/or edge deletion | PERFECT MATCHINGS | COMPUTER SCIENCE, THEORY & METHODS | INTERCONNECTION NETWORKS | Matching | Deletion | Graphs | Violins
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 12/2012, Volume 465, pp. 10 - 20
Matching preclusion is a measure of robustness in the event of edge failure in interconnection networks. The matching preclusion number of a graph G is the... 
Almost perfect matching | Perfect matching | Matching preclusion set | Balanced hypercubes | COMPUTER SCIENCE, THEORY & METHODS | INTERCONNECTION NETWORKS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2019, Volume 759, pp. 61 - 71
The matching preclusion number of a graph G, denoted by mp(G), is the minimum number of edges whose deletion results in a graph that has neither perfect... 
Nordhaus–Gaddum problem | Perfect matching | Extremal problem | Matching preclusion number | Interconnection networks | COMPUTER SCIENCE, THEORY & METHODS | Nordhaus-Gaddum problem
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 04/2019, Volume 90, Issue 4, pp. 535 - 546
A graph G is matching‐covered if every edge of G is contained in a perfect matching. A matching‐covered graph G is strongly coverable if, for any edge e of G,... 
matching‐covered graph | perfect matching | matching-covered graph | MATHEMATICS | EAR-DECOMPOSITIONS
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2016, Volume 30, Issue 3, pp. 1351 - 1357
We prove a new upper bound for the minimum d-degree threshold for perfect matchings in k-uniform hypergraphs when d < k/2. As a consequence, this determines... 
Hypergraph | Perfect matching | Erdös matching conjecture | MATHEMATICS, APPLIED | perfect matching | MINIMUM DEGREE THRESHOLDS | hypergraph | Erdos matching conjecture | UNIFORM HYPERGRAPHS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, pp. 22 - 27
Consider a situation in which individuals –the buyers –have different valuations for the products of a given set. An envy-free assignment of product items to... 
Assignment | Shortest path problem | Walrasian equilibrium | Perfect matching | Envy-free pricing | MATHEMATICS, APPLIED | CONJOINT | OPTIMIZATION | Valuation | Pricing | Purchasing
Journal Article
Discrete Mathematics, ISSN 0012-365X, 03/2018, Volume 341, Issue 3, pp. 748 - 758
A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. A d-matching in a 3-uniform hypergraph H is a matching of size d. Let V1,V2 be a... 
Matching | 3-uniform hypergraph | Adjacent vertices | VERTEX DEGREE | MATHEMATICS | PERFECT MATCHINGS | INDEPENDENT EDGES | MINIMUM DEGREE THRESHOLDS | ERDOS | UNIFORM HYPERGRAPHS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2018, Volume 713, pp. 11 - 20
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor... 
Strong matching preclusion number | Perfect matching | Interconnection networks | CUBES | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 09/2012, Volume 160, Issue 13-14, pp. 1936 - 1954
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor... 
Regular graphs | Matching preclusion | Perfect matching | Interconnection networks | MATHEMATICS, APPLIED | FAULT HAMILTONIAN CONNECTIVITY | ARRANGEMENT GRAPHS | ALTERNATING GROUP | Matching | Networks | Interconnection | Mathematical analysis | Classification | Deletion | Graphs | Optimization
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2017, Volume 687, pp. 40 - 47
The matching preclusion number of a graph is the minimum number of edges whose deletion results in the remaining graph that has neither perfect matchings nor... 
Matching preclusion | Almost perfect matching | Torus networks | Perfect matching | COMPUTER SCIENCE, THEORY & METHODS | GRAPHS
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 04/2018, Volume 323, pp. 58 - 63
Given a graph G=(V,E), a subset S of V is a dominating set of G if every vertex in V∖S is adjacent to a vertex in S. The minimum cardinality of a dominating... 
Critical | Perfect matching | Nontrivial cut edge | Domination number | DOMINATION-CRITICAL GRAPHS | MATHEMATICS, APPLIED | 3-DOMINATION CRITICAL GRAPHS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 01/2019, Volume 755, pp. 38 - 47
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has no perfect matchings or almost-perfect... 
Lexicographic product | Direct product | Strong product | Cluster | Join | Corona | Matching preclusion | Perfect matching | Cartesian product | Interconnection networks | HYPERCUBES | FAULT HAMILTONIAN CONNECTIVITY | CYCLES | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2018, Volume 711, pp. 36 - 43
Let G1=(V1,E1), G2=(V2,E2), ⋯, Gk=(Vk,Ek) be k graphs, and let f1:V1→V2, f2:V2→V3, ⋯, fk−1:Vk−1→Vk, fk:Vk→V1 be k bijections. The k-composition networks G... 
Almost perfect matching | Perfect matching | Interconnection networks | Strong matching preclusion | TORUS NETWORKS | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 8/2017, Volume 34, Issue 2, pp. 522 - 533
Journal Article
Networks, ISSN 0028-3045, 07/2012, Volume 59, Issue 4, pp. 357 - 364
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect... 
perfect matching | Cayley graphs | interconnection networks | hyper‐stars | hyper-stars | FAULTY VERTICES | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MAXIMAL CONNECTED COMPONENT
Journal Article
Journal of Synchrotron Radiation, ISSN 1600-5775, 11/2019, Volume 26, Issue 6, pp. 1917 - 1923
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.